OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #507 from ericcurtin/patch-1

Browse Source 
heapsort does not work for sorted input 1,2,3,4,5
This commit is contained in:
Hai Hoang Dang 2020-01-03 19:19:05 -08:00 committed by GitHub
commit c896b07e89
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 53 additions and 55 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

104
sorting/HeapSort.c
View File

@ -1,62 +1,60 @@
#include <stdio.h> #include <stdio.h>
void heapify(int *unsorted, int index, int heap_size); void max_heapify(int* a, int i, int n);
void heap_sort(int *unsorted, int n); void heapsort(int* a, int n);
void build_maxheap(int* a, int n);
void max_heapify(int* a, int i, int n) {
int j, temp;
temp = a[i];
j = 2 * i;
while (j <= n) {
if (j < n && a[j + 1] > a[j])
j = j + 1;
if (temp > a[j]) {
break;
} else if (temp <= a[j]) {
a[j / 2] = a[j];
j = 2 * j;
}
}
a[j / 2] = temp;
return;
}
void heapsort(int* a, int n) {
int i, temp;
for (i = n; i >= 2; i--) {
temp = a[i];
a[i] = a[1];
a[1] = temp;
max_heapify(a, 1, i - 1);
}
}
void build_maxheap(int* a, int n) {
int i;
for (i = n / 2; i >= 1; i--) {
max_heapify(a, i, n);
}
}
int main() { int main() {
int n = 0; int n, i;
int i = 0; printf("Enter number of elements of array\n");
char oper;
int* unsorted;
printf("Enter the size of the array you want\n");
scanf("%d", &n); scanf("%d", &n);
unsorted = (int*)malloc(sizeof(int) * n); int a[20];
while (getchar() != '\n'); for (i = 1; i <= n; i++) {
printf("Enter numbers separated by a comma:\n"); printf("Enter Element %d\n", i);
while (i != n) { scanf("%d", a + i);
scanf("%d,", (unsorted + i));
i++;
} }
heap_sort(unsorted, n);
printf("["); build_maxheap(a, n);
printf("%d", *(unsorted)); heapsort(a, n);
for (int i = 1; i < n; i++) { printf("Sorted Output\n");
printf(", %d", *(unsorted + i)); for (i = 1; i <= n; i++) {
} printf("%d\n", a[i]);
printf("]");
}
void heapify(int *unsorted, int index, int heap_size) {
int temp;
int largest = index;
int left_index = 2 * index;
int right_index = 2 * index + 1;
if (left_index < heap_size && *(unsorted + left_index) > *(unsorted + largest)) {
largest = left_index;
}
if (right_index < heap_size && *(unsorted + right_index) > *(unsorted + largest)) {
largest = right_index;
}
if (largest != index) {
temp = *(unsorted + largest);
*(unsorted + largest) = *(unsorted + index);
*(unsorted + index) = temp;
heapify(unsorted, largest, heap_size);
}
}
void heap_sort(int *unsorted, int n) {
int temp;
for (int i = n / 2 - 1; i > -1; i--) {
heapify(unsorted, i, n);
}
for (int i = n - 1; i > 0; i--) {
temp = *(unsorted);
*(unsorted) = *(unsorted + i);
*(unsorted + i) = temp;
heapify(unsorted, 0, i);
} }
getchar();
} }