diff --git a/C/heapsort.c b/C/heapsort.c
new file mode 100644
index 0000000..28c6869
--- /dev/null
+++ b/C/heapsort.c
@@ -0,0 +1,62 @@
+#include<stdio.h>
+ 
+void create(int []);
+void down_adjust(int [],int);
+ 
+void main()
+{
+    int heap[30],n,i,last,temp;
+    printf("Enter no. of elements:");
+    scanf("%d",&n);
+    printf("\nEnter elements:");
+    for(i=1;i<=n;i++)
+        scanf("%d",&heap[i]);
+    
+    heap[0]=n;
+    create(heap);
+    
+    while(heap[0] > 1)
+    {
+        last=heap[0];
+        temp=heap[1];
+        heap[1]=heap[last];
+        heap[last]=temp;
+        heap[0]--;
+        down_adjust(heap,1);
+    }
+ 
+    //print sorted data
+    printf("\nArray after sorting:\n");
+    for(i=1;i<=n;i++)
+        printf("%d ",heap[i]);
+}
+ 
+void create(int heap[])
+{
+    int i,n;
+    n=heap[0]; 
+    for(i=n/2;i>=1;i--)
+        down_adjust(heap,i);
+}
+ 
+void down_adjust(int heap[],int i)
+{
+    int j,temp,n,flag=1;
+    n=heap[0];
+    
+    while(2*i<=n && flag==1)
+    {
+        j=2*i;    
+        if(j+1<=n && heap[j+1] > heap[j])
+            j=j+1;
+        if(heap[i] > heap[j])
+            flag=0;
+        else
+        {
+            temp=heap[i];
+            heap[i]=heap[j];
+            heap[j]=temp;
+            i=j;
+        }
+    }
+}
\ No newline at end of file