java語言實現堆排序

標籤：int   string   ring   ++   pac   print   static   ext   and   

package secondChapter;import java.util.Random;public class HeapSort {        private static int AHeapSize;        public static void main(String[] args) {                HeapSort hs = new HeapSort();        int[] A = new int[10];        //產生隨機數組        for(int i=0;i<A.length;i++){            A[i] = hs.generateRandomInt(50);        }        System.out.print("Original array：");        for (int i = 0; i < A.length; i++) {            System.out.print(A[i]+" ");        }        System.out.println();                hs.heap_sort(A);                System.out.print("Sorted array: ");        for (int i = 0; i < A.length; i++) {            System.out.print(A[i]+" ");        }    }        //HEAPSORT過程    public void heap_sort(int[] A) {        AHeapSize = A.length;        build_max_heap(A);                System.out.print("build_max_heap: ");        for (int i = 0; i < A.length; i++) {            System.out.print(A[i]+" ");        }        System.out.println();                        for(int i=A.length;i>1;i--){            int temp = A[0];            A[0] = A[i-1];            A[i-1] = temp;                        AHeapSize -= 1;            max_heapify(A,1);        }    }        //HUILD-MAX-HEAP過程    public void build_max_heap(int[] A) {        for(int i=A.length/2;i>0;i--){            max_heapify(A,i);        }    }        //MAX-HEAPIFY過程    public void max_heapify(int[] A, int i) {    //i為 元素下標+1        int l = 2*i;        int r = 2*i+1;                int largest;        if(l<=AHeapSize && A[l-1]>A[i-1]){            largest = l;        }else{            largest = i;        }        if(r<=AHeapSize && A[r-1]>A[largest-1]){            largest = r;        }        if(largest!=i){            int temp = A[i-1];            A[i-1] = A[largest-1];            A[largest-1] = temp;                        max_heapify(A, largest);        }    }        private Random rd = new Random();    public int generateRandomInt(int bound) {        return rd.nextInt(bound);    }    }

輸出結果：

Original array：40 44 11 43 25 0 7 14 34 14
build_max_heap: 44 43 11 40 25 0 7 14 34 14
Sorted array: 0 7 11 14 14 25 34 40 43 44

java語言實現堆排序