Java排序算法实现----堆排序_jvaa堆排序算法-CSDN博客

本文链接：https://blog.csdn.net/weixin_43288335/article/details/105766784

public class HeapSort {
    static void sort(int[] nums){
        int len = nums.length;
        //从最后一个非叶子节点开始，按层级遍历的倒序找到最大值放在堆顶
        buildBigHeap(nums, len);
        //每次找到最大值(大顶堆堆顶值)都放到未排序部分的最后一个位置，相当于放到堆外
        for (int i=len-1;i>0;i--){
            int temp = nums[i];
            nums[i] = nums[0];
            nums[0] = temp;
            len--;
            adjust(nums,0,len);
        }
    }

    static void buildBigHeap(int[] nums,int len){
        //nums.length/2-1即为最后一个非叶子节点
        for (int i=nums.length/2-1;i>=0;i--){
            adjust(nums,i,len);
        }
    }

    static void adjust(int[] nums, int father, int len){

        int max = father;
        int left = father*2+1;
        int right = father*2+2;
        //最大值与左子节点比较
        if (left < len && nums[max] < nums[left]){
            max = left;
        }
        //最大值与右子节点比较
        if (right < len && nums[max] < nums[right]){
            max = right;
        }
        //交换最大值和当前堆顶值
        if (max != father){
            int temp = nums[max];
            nums[max] = nums[father];
            nums[father] = temp;
            adjust(nums,max,len);
        }
    }

    public static void main(String[] args) {
        int[] nums = {4,3,2,5,6,7,1};
        sort(nums);
        System.out.println(nums);
    }
}