diff --git a/Heap Sort .cpp b/Heap Sort .cpp
new file mode 100644
index 000000000..f188a0ea9
--- /dev/null
+++ b/Heap Sort .cpp	
@@ -0,0 +1,62 @@
+#include <iostream>
+#include <conio.h>
+using namespace std;
+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 n, i, x;
+	cout << "Enter number of elements of array\n";
+	cin >> n;
+	int a[20];
+	for (i = 1; i <= n; i++)
+	{
+		cout << "Enter Element " << (i) << endl;
+		cin >> a[i];
+	}
+	build_maxheap(a, n);
+	heapsort(a, n);
+	cout << "Sorted Output\n";
+	for (i = 1; i <= n; i++)
+	{
+		cout << a[i] << endl;
+	}
+	getch();
+}