public static int[] sort(int[] arr) {
int[] temp = new int[arr.length];
BinaryHeap heap = new BinaryHeap();
for (int i : arr) {
heap.add(i);
}
for (int i = 0; i < arr.length; i++) {
temp[arr.length - i - 1] = heap.swapLowestWithRootAndRemove();
}
return temp;
}
