diff --git a/Java/HeapSort.java b/Java/HeapSort.java
new file mode 100644
index 0000000..35ef707
--- /dev/null
+++ b/Java/HeapSort.java
@@ -0,0 +1,57 @@
+// Heap Sort in Java
+  
+  public class HeapSort {
+  
+    public void sort(int arr[]) {
+      int len = arr.length;
+      
+     for (int i = len / 2 - 1; i >= 0; i--) {
+        heapify(arr, len, i);
+      }
+  
+      for (int i = len - 1; i >= 0; i--) {
+        int temp = arr[0];
+        arr[0] = arr[i];
+        arr[i] = temp;
+  
+        heapify(arr, i, 0);
+      }
+    }
+  
+    void heapify(int arr[], int len, int i) {
+      int largest = i;
+      int l = 2 * i + 1;
+      int r = 2 * i + 2;
+  
+      if (l < len && arr[l] > arr[largest])
+        largest = l;
+  
+      if (r < len && arr[r] > arr[largest])
+        largest = r;
+  
+      if (largest != i) {
+        int swap = arr[i];
+        arr[i] = arr[largest];
+        arr[largest] = swap;
+  
+        heapify(arr, len, largest);
+      }
+    }
+  
+    static void printArray(int arr[]) {
+      int length = arr.length;
+      for (int i = 0; i < length; ++i)
+        System.out.print(arr[i] + " ");
+        System.out.println();
+    }
+  
+    public static void main(String args[]) {
+      int arr[] = { 3, 15, 10, 8, 5, 11 };
+  
+      HeapSort heapsort = new HeapSort();
+      heapsort.sort(arr);
+  
+      System.out.println("Array after sorting: ");
+      printArray(arr);
+    }
+  }