-
Notifications
You must be signed in to change notification settings - Fork 34
/
heap_sort.c
83 lines (62 loc) · 1.22 KB
/
heap_sort.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
73
74
75
76
77
78
79
80
81
82
83
#include <stdio.h>
#include <stdlib.h>
void swap(int *a, int *b){
int aux;
aux = *a;
*a = *b;
*b = aux;
return;
}
int *heapify(int *arr, int n, int i){
int largest = i;
int l = 2*i + 1;
int r = 2*i + 2;
if (l < n && arr[l] > arr[largest])
largest = 1;
if (r < n && arr[r] > arr[largest])
largest = r;
if (largest != i){
swap(&arr[i], &arr[largest]);
arr = heapify(arr, n, largest);
}
return arr;
}
int * heapsort(int size, int *array){
int i, j;
for ( i = size / 2 - 1; i >= 0; i--){
array = heapify(array, size, i);
}
for(i = size-1; i>=0; i--){
swap(&array[0], &array[i]);
array = heapify(array, i, 0);
}
return array;
}
void printArray(int size, int *array){
int i;
if(size == 0){
printf("Your array has no elements :(\n");
return;
}
printf("Ordered array: |");
for(i=0;i<size;i++){
printf(" %d |", array[i]);
}
printf("\n");
return;
}
int main(){
int *array;
int size;
int i;
printf("Enter the size of the array: ");
scanf("%d", &size);
array = (int *) malloc(size * sizeof(int));
for(i=0;i<size;i++){
printf("Enter the element %d of the array: ", i);
scanf("%d", &array[i]);
}
array = heapsort(size, array);
printArray(size, array);
return 0;
}