-
Notifications
You must be signed in to change notification settings - Fork 0
/
heapify.c
72 lines (55 loc) · 1.51 KB
/
heapify.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
60
61
62
63
64
65
66
67
68
69
70
71
72
#include<stdio.h>
#include<conio.h>
int main()
{
int arr[]={48,10,23,43,28,26,1};
int n=sizeof(arr)/sizeof(arr[0]);
printf("Before sorting array element\n");
printarr(arr,n);
heapsort(arr,n);
printf("\nAfter sorting array element:\n");
printarr(arr,n);
getch();
return 0;
}
void heapify(int arr[],int n, int i)
{
int largest=i;
int left=2*i+1; //left child //
int right=2*i+2; //right child//
//if left child is larger than root//
if(n>left && arr[left]>arr[largest])
largest=left;
//if right child is larger than root//
if(n>right && arr[right]>arr[largest])
largest=right;
// if root is not largest//
if(largest!=i)
{
//swap arr[i] to arr[largest]//
int temp=arr[i];
arr[i]=arr[largest];
arr[largest]=temp;
}
}
void heapsort(int arr[], int n)
{
for (int i = n / 2 - 1; i >= 0; i--)
heapify(arr, n,i);
// One by one extract an element from heap
for (int i = n - 1; i >= 0; i--) {
/* Move current root element to end*/
// swap a[0] with a[i]
temp = arr[0];
arr[0] = arr[i];
arr[i] = temp;
heapify(arr, i, 0);
}
}
void printarr(arr[], int n)
{
for(i=0; i<n; i++)
{
printf("%d\t",arr[i]);
}
}