Anonymous user
Sorting algorithms/Heapsort: Difference between revisions
Added C
(added Haskell) |
(Added C) |
||
Line 126:
New_Line;
end Test_Generic_Heapsort;</lang>
=={{header|C}}==
<lang c>#include <stdio.h>
#include <stdlib.h>
#define ValType double
#define IS_LESS(v1, v2) (v1 < v2)
void siftDown( ValType *a, int start, int count);
#define SWAP(r,s) do{ValType t=r; r=s; s=t; } while(0)
void heapsort( ValType *a, int count)
{
int start, end;
/* heapify */
start = (count-2)/2;
while (start >= 0) {
siftDown( a, start, count);
start -= 1;
}
end = count-1;
while (end > 0) {
SWAP(a[end],a[0]);
siftDown(a, 0, end);
end -= 1;
}
}
void siftDown( ValType *a, int start, int end)
{
int root = start;
while ( root*2+1 < end ) {
int child = 2*root + 1;
if ((child + 1 < end) && IS_LESS(a[child],a[child+1])) {
child += 1;
}
if (IS_LESS(a[root], a[child])) {
SWAP( a[child], a[root] );
root = child;
}
else
return;
}
}
int main(int argc, char *argv[])
{
int ix;
double valsToSort[] = {
1.4, 50.2, 5.11, -1.55, 301.521, 0.3301, 40.17,
-18.0, 88.1, 30.44, -37.2, 3012.0, 49.2};
#define VSIZE (sizeof(valsToSort)/sizeof(valsToSort[0]))
heapsort(valsToSort, VSIZE);
printf("{");
for (ix=0; ix<VSIZE; ix++) printf(" %.3f ", valsToSort[ix]);
printf("}\n");
return 0;
}</lang>
=={{header|C sharp|C#}}==
| |||