推排序-非递归

时间复杂度为O(N)非递归空间复杂度可达到O(1)
堆排序理解：
https://www.cnblogs.com/chengxiao/category/880910.html

package com.atguigu.tree;

import java.text.SimpleDateFormat;
import java.util.Date;

// 堆排序 非递归
public class HeapSort {

    public static void main(String[] args) {
        // int arr[] = {4,6,8,5,9};
        // 8000000 -> 1s 60000000 -> 15s 80000000 -> 20s
        int[] arr = new int[60000000];
        for (int i = 0; i < 60000000; i++) {
            arr[i] = (int) (Math.random() * 60000000); // 生成一个[0, 8000000) 数
        }

        System.out.println("排序前");
        Date data1 = new Date();
        SimpleDateFormat simpleDateFormat = new SimpleDateFormat("yyyy-MM-dd HH:mm:ss");
        String date1Str = simpleDateFormat.format(data1);
        System.out.println("排序前的时间是=" + date1Str);

        heapSort(arr);

        Date data2 = new Date();
        String date2Str = simpleDateFormat.format(data2);
        System.out.println("排序后的时间是=" + date2Str);
    }

    public static void heapSort(int arr[]) {
        int temp = 0;
        System.out.println("堆排序");
        for (int i = arr.length / 2 - 1; i >= 0; i--) {
            adjustHeap(arr,i,arr.length);
        }
        for (int j = arr.length - 1; j > 0; j--) {
            temp = arr[j];
            arr[j] = arr[0];
            arr[0] = temp;
            adjustHeap(arr,0,j);
        }
    }

    public static void adjustHeap(int arr[], int i, int length) {
        int temp = arr[i];
        for (int k = i * 2 + 1; k < length; k = k * 2 + 1) {
            if (k + 1 < length && arr[k] < arr[k+1]) {
                k++;
            }
            if (arr[k] > temp) {
                arr[i] = arr[k];
                i = k;
            } else {
                break;
            }
        }
        arr[i] = temp;
    }

}