From 46d2963de2153bcb3cf9a8455ddd1fc52ed80608 Mon Sep 17 00:00:00 2001
From: Vansh Badkul <vanshbadkul@gmail.com>
Date: Sat, 29 Oct 2016 00:14:11 +0530
Subject: [PATCH] heap sort

---
 Sortings/heapSort.c | 58 +++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 Sortings/heapSort.c

diff --git a/Sortings/heapSort.c b/Sortings/heapSort.c
new file mode 100644
index 0000000..a08e7c3
--- /dev/null
+++ b/Sortings/heapSort.c
@@ -0,0 +1,58 @@
+/*
+ * C Program to sort an array based on heap sort algorithm(MAX heap)
+ */
+#include <stdio.h>
+
+void main()
+{
+    int heap[10], no, i, j, c, root, temp;
+
+    printf("\n Enter no of elements :");
+    scanf("%d", &no);
+    printf("\n Enter the nos : ");
+    for (i = 0; i < no; i++)
+       scanf("%d", &heap[i]);
+    for (i = 1; i < no; i++)
+    {
+        c = i;
+        do
+        {
+            root = (c - 1) / 2;
+            if (heap[root] < heap[c])   /* to create MAX heap array */
+            {
+                temp = heap[root];
+                heap[root] = heap[c];
+                heap[c] = temp;
+            }
+            c = root;
+        } while (c != 0);
+    }
+
+    printf("Heap array : ");
+    for (i = 0; i < no; i++)
+        printf("%d\t ", heap[i]);
+    for (j = no - 1; j >= 0; j--)
+    {
+        temp = heap[0];
+        heap[0] = heap[j    /* swap max element with rightmost leaf element */
+        heap[j] = temp;
+        root = 0;
+        do
+        {
+            c = 2 * root + 1;    /* left node of root element */
+            if ((heap[c] < heap[c + 1]) && c < j-1)
+                c++;
+            if (heap[root]<heap[c] && c<j)    /* again rearrange to max heap array */
+            {
+                temp = heap[root];
+                heap[root] = heap[c];
+                heap[c] = temp;
+            }
+            root = c;
+        } while (c < j);
+    }
+    printf("\n The sorted array is : ");
+    for (i = 0; i < no; i++)
+       printf("\t %d", heap[i]);
+    printf("\n Complexity : \n Best case = Avg case = Worst case = O(n logn) \n");
+}