Java Heap Sort

public class HeapSort {
    public static void sort(int[] number) {
        int[] tmp = new int[number.length + 1];
       
        // 配合說明，使用一個有徧移的暫存陣列
        for(int i = 1; i < tmp.length; i++) {
            tmp[i] = number[i-1];  
        }
       
        createHeap(tmp);
       
        int m = number.length;
        while(m > 1) {
            swap(tmp, 1, m);
            m--;

            int p = 1;
            int s = 2 * p;

            while(s <= m) {
                if(s < m && tmp[s+1] < tmp[s])
                    s++;
                if(tmp[p] <= tmp[s])
                    break;
                swap(tmp, p, s);
                p = s;
                s = 2 * p;
            }
        }
       
        // 這邊將排序好的暫存陣列設定回原陣列
for(int i = 0; i < number.length; i++) {
            number[i] = tmp[i+1];  
        }
    }
   
    private static void createHeap(int[] tmp) {
        int[] heap = new int[tmp.length];
       
        for(int i = 0; i < heap.length; i++)
            heap[i] = -1;

        for(int i = 1; i < heap.length; i++) {
            heap[i] = tmp[i];
            int s = i;
            int p = i / 2;
while(s >= 2 && heap[p] > heap[s]) {
                swap(heap, p, s);
                s = p;
                p = s / 2;
            }
        }

        for(int i = 1; i < tmp.length; i++)
            tmp[i] = heap[i];
       
    }
   
    private static void swap(int[] number, int i, int j) {
        int t;
        t = number[i];
        number[i] = number[j];
        number[j] = t;
    }
}