Heap Sort Implementation in Java

HeapSort.java

public static void heapSort(int arr[]) {
  for (int i = arr.length / 2 - 1; i >= 0; i--) {
    heapify(arr, i);
  }

  for (int i = arr.length - 1; i >= 0; i--) {
    int temp = arr[0];
    arr[0] = arr[i];
    arr[i] = temp;

    heapify(arr, i, 0);
  }
}

private static void heapify(int arr[], int i) {
  int largest = i;
  int left = 2 * i + 1;
  int right = 2 * i + 2;

  if (left < arr.length && arr[left] > arr[largest])
    largest = left;

  if (right < arr.length && arr[right] > arr[largest])
    largest = right;

  if (largest != i) {
    int temp = arr[i];
    arr[i] = arr[largest];
    arr[largest] = temp;

    heapify(arr, largest);
  }
}