public class HeapSort { public static void main(String[] args) { int n = 20; Random ran = new Random(); int[] arr = new int[n]; Heap<Integer> heap = new Heap<Integer>(n, new Comparator<Integer>() { public int compare(Integer o1, Integer o2) { return o2 - o1; } }); for (int i = 0; i < n; i++) { int o = ran.nextInt(100); arr[i] = o; heap.add(o); } System.out.println(Arrays.toString(arr)); // System.out.println(Arrays.toString(heap.getHeap())); // System.out.println(heap.getHeap()[heap.count()]); // heap.swap(heap.getHeap(), 1, heap.count()); // System.out.println("swap:" + Arrays.toString(heap.getHeap())); // heap.heapify(1, heap.count()); System.out.println(Arrays.toString(heap.getHeap()));