#include "stdio.h"
#include "stdlib.h"
#include "time.h"
#define LESS(A,B) ((A)<(B)) ? 1:0
#define SWAP(A,B) {int t; t = (A); (A) = (B); (B) = t;}
void fixDown(int a[], int k, int n);
void heapSort(int a[], int left, int right);
int main(int argc, char* argv[]){
int a[100] = {0};
srand(time(NULL));
for(int i = 0 ; i< 100; i++)
{
a[i] = rand() % 100;
printf("%d,", a[i]);
}
printf("\n sorting ...\n");
heapSort(a, 0, 99);
for(int i = 0 ; i< 100; i++)
{
printf("%d,", a[i]);
}
getchar();
}
void heapSort(int a[], int left, int right)
{
int k, n = right - left+1;
int *p = a + left;
for( k = (n-2)/2 ; k >= 0; k--)
fixDown(p,k,n-1);
n--;
while( n >= 1){
SWAP(p[0], p[n]);
fixDown(p, 0, --n);
}
}
void fixDown(int a[], int k, int n){
int j;
while( (2*k+1) <= n)
{
j = 2*k+1;
if( j < n && LESS(a[j],a[j+1]))
j++;
if(!LESS(a[k],a[j]))
break;
SWAP(a[k], a[j]);
k = j;
}
}
#include "stdlib.h"
#include "time.h"
#define LESS(A,B) ((A)<(B)) ? 1:0
#define SWAP(A,B) {int t; t = (A); (A) = (B); (B) = t;}
void fixDown(int a[], int k, int n);
void heapSort(int a[], int left, int right);
int main(int argc, char* argv[]){
int a[100] = {0};
srand(time(NULL));
for(int i = 0 ; i< 100; i++)
{
a[i] = rand() % 100;
printf("%d,", a[i]);
}
printf("\n sorting ...\n");
heapSort(a, 0, 99);
for(int i = 0 ; i< 100; i++)
{
printf("%d,", a[i]);
}
getchar();
}
void heapSort(int a[], int left, int right)
{
int k, n = right - left+1;
int *p = a + left;
for( k = (n-2)/2 ; k >= 0; k--)
fixDown(p,k,n-1);
n--;
while( n >= 1){
SWAP(p[0], p[n]);
fixDown(p, 0, --n);
}
}
void fixDown(int a[], int k, int n){
int j;
while( (2*k+1) <= n)
{
j = 2*k+1;
if( j < n && LESS(a[j],a[j+1]))
j++;
if(!LESS(a[k],a[j]))
break;
SWAP(a[k], a[j]);
k = j;
}
}