Algorithm : Heap Sort on Array
Complexity :O(n logn)
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 |
/* Heap Sort on array code from Codingstreet.com */ #include<stdio.h> void swap(int *p,int *q){ int t; t=*q; *q=*p; *p=t; } int parent(int i){ return i/2;} int left(int i){ return 2*i;} int right(int i){ return 2*i+1;} void max_heapify(int A[],int i,int *hs){ int l,r,largest; int hsize=*hs; l=left(i); r=right(i); if(l<=hsize && A[l]>A[i]) largest=l; else largest=i; if(r<=hsize && A[r]>A[largest]) largest=r; if (largest!=i){ swap(&A[i],&A[largest]); max_heapify(A,largest,hs); } } void build_max_heap(int A[],int *hs){ int heapsize=*hs; int i,length=heapsize; for(i=length/2;i>=0;i--) max_heapify(A,i,hs); } void heapsort(int A[],int *hsize){ build_max_heap(A,hsize); int length=*hsize; int i; for(i=length;i>=1;i--){ swap(&A[i],&A[0]); *hsize=*hsize-1; max_heapify(A,0,hsize); } } int main(){ int i=5,A[]={55,50,59,33,62,1}; heapsort(A,&i); for(i=0;i<6;i++) printf("%d ",A[i]); return 0; } |
Heap sort in Array code in C .