class HeapSort
package DataStructures.sort;
import java.util.Arrays;
public class HeapSort {
public static void main(String[] args) {
int[] arr = {4,6,8,5,9};
heapSort(arr);
}
public static void heapSort(int[] arr){
int temp;
for (int i = arr.length / 2 - 1; i >= 0; i--) {
adjustHeap(arr,i,arr.length);
}
for (int i = arr.length - 1; i > 0; i--) {
temp = arr[i];
arr[i] = arr[0];
arr[0] = temp;
adjustHeap(arr,0,i);
}
System.out.println(Arrays.toString(arr));
}
public static void adjustHeap(int[] arr,int i,int len){
int temp = arr[i];
for (int j = i * 2 + 1; j < len; j = j * 2 + 1) {
if (j + 1 < len && arr[j] < arr[j + 1]){
j++;
}
if (arr[j] > temp){
arr[i] = arr[j];
i = j;
}else {
break;
}
arr[j] = temp;
}
}
}