-
Notifications
You must be signed in to change notification settings - Fork 0
/
104-heap_sort.c
67 lines (59 loc) · 1.39 KB
/
104-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
#include "sort.h"
void swap(int *a, int *b);
void heapify(int *array, size_t size, int i, size_t print_size);
void heap_sort(int *array, size_t size);
/**
* swap - Swaps two integers in an array.
* @a: The first integer to swap.
* @b: The second integer to swap.
*/
void swap(int *a, int *b)
{
int tmp = *a;
*a = *b;
*b = tmp;
}
/**
* heapify - Turns the array into a max heap.
* @array: The array.
* @size: The size of the array.
* @i: The current index.
* @print_size: Size of the array to print.
*/
void heapify(int *array, size_t size, int i, size_t print_size)
{
int largest = i;
int left = 2 * i + 1;
int right = 2 * i + 2;
if (left < (int)size && array[left] > array[largest])
largest = left;
if (right < (int)size && array[right] > array[largest])
largest = right;
if (largest != i)
{
swap(&array[i], &array[largest]);
print_array(array, print_size);
heapify(array, size, largest, print_size);
}
}
/**
* heap_sort - Sorts an array of integers in ascending order
* using the heap sort algorithm.
* @array: The array to be sorted.
* @size: The size of the array.
*/
void heap_sort(int *array, size_t size)
{
int i;
if (!array || size < 2)
return;
for (i = size / 2 - 1; i >= 0; i--)
heapify(array, size, i, size);
for (i = size - 1; i >= 0; i--)
{
swap(&array[0], &array[i]);
if (i != 0)
print_array(array, size);
heapify(array, i, 0, size);
}
}