In this tutorial you will learn about the Heap Sort Algorithm and its application with practical example.
Heap Sort Program In C
|
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 55 56 57 58 59 |
#include<stdio.h> void heapsort(int[],int); void heapify(int[],int); void adjust(int[],int); main() { int n,i,a[50]; printf("Enter number of elements: "); scanf("%d",&n); printf("Enter %d integer numbers\n", n); for (i=0;i<n;i++) scanf("%d",&a[i]); heapsort(a,n); printf("Elements after sorting: "); for (i=0;i<n;i++) printf(" %d",a[i]); printf("\n"); } void heapsort(int a[],int n) { int i,t; heapify(a,n); for (i=n-1;i>0;i--) { t = a[0]; a[0] = a[i]; a[i] = t; adjust(a,i); } } void heapify(int a[],int n) { int k,i,j,item; for (k=1;k<n;k++) { item = a[k]; i = k; j = (i-1)/2; while((i>0)&&(item>a[j])) { a[i] = a[j]; i = j; j = (i-1)/2; } a[i] = item; } } void adjust(int a[],int n) { int i,j,item; j = 0; item = a[j]; i = 2*j+1; while(i<=n-1) { if(i+1 <= n-1) if(a[i] <a[i+1]) i++; if(item<a[i]) { a[j] = a[i]; j = i; i = 2*j+1; } else break; } a[j] = item; } |
Output:-
