堆排序的基本思想是:利用数组的特点快速定位指定索引的元素,并将其构造成一个大顶堆,它可以被看作是一个完全二叉树。大顶堆的要求是每个节点的值都不大于其父节点的值。
Java代码实现此算法如下:
package hanxl.insist.seven;
import java.util.Arrays;
/**
* 堆排序
* @author 韩兴隆
*/
public class HeapSort {
private static int[] sort = { 23, 45, 12, 56, 32, 78, 1, 3, 90, 678, 2, 4, 8, 92, 67, 49 };
public static void main(String[] args) {
buildMaxHeapify(sort);
heapSort(sort);
System.out.println(Arrays.toString(sort));
}
/**
* 由于是大顶堆,数组的第一个元素是整个数组中的最大值
* 让其与数组中最后一个元素交换,并调用maxHeapify方法使大顶堆恢复平衡
* @param data
*/
private static void heapSort(int[] data) {
int size = data.length;
for (int i = size - 1; i >= 1; i--) {
swap(data, 0, i);
maxHeapify(data, --size, 0);
}
}
/**
* 用给定的数组由下至上创建大顶堆
*/
private static void buildMaxHeapify(int[] data) {
// 由完全二叉树的性质可得:在数组中,叶节点的下标从{n/2(向下取整)}开始
for (int i = data.length / 2 - 1; i >= 0; i--) {
maxHeapify(data, data.length, i);
}
}
private static void maxHeapify(int[] data, int heapSize, int index) {
//获取当前节点的左右孩子
int left = getChildLeftIndex(index);
int right = getChildRightIndex(index);
int largest = index;
if (left < heapSize && data[index] < data[left])
largest = left;
if (right < heapSize && data[largest] < data[right])
largest = right;
if (largest != index) {
swap(data, index, largest);
maxHeapify(data, heapSize, largest);
}
}
private static void swap(int[] data, int a, int b) {
int temp = data[a];
data[a] = data[b];
data[b] = temp;
}
private static int getChildLeftIndex(int current) {
//左移一位相当于将原数扩大二倍
return (current << 1) + 1;
}
private static int getChildRightIndex(int current) {
//左移一位相当于将原数扩大二倍
return (current << 1) + 2;
}
}