堆排序算法
package com.mei.practice;
import java.util.Arrays;
//parent = 向下取整【(i-1)/2】
//leftChild = 2*i+1
//rigthChild = 2*i+2
public class Heap {
public static void main(String[] args) {
int[] arr = {4,2,5,3,10,1};
new Heap().headSort(arr);
原创
2021-09-19 12:34:17 ·
68 阅读 ·
0 评论