利用堆排序排序算法对一个元素个数不少于20的随机序列进行排序，输出每趟排序的中间结果和每趟中关键字的比较次数和元素的移动次数。

【专家解说】：package com.help;import java.util.Scanner;public class VariableSort { public static void main(String[] args) { Scanner input = new Scanner(System.in); int x = input.nextInt(); int[] a = new int[x]; //这里是我输入的数组长度。所以产生出的a.length就会等于x // int[] a = new int[20]; System.out.println("数组元素个数为："+x); for (int i = 0; i < 20; ++i) a[i] = (int) (Math.random() * 10); heapSort(a); } static void swap(int[] a, int x, int y) { int t = a[x]; a[x] = a[y]; a[y] = t; } static int maxHeapify(int[] a, int i, int n) { int l, r, c = 0, m; do { r = 2 * (i + 1); l = r - 1; m = l < n && a[l] > a[i] ? l : i; m = r < n && a[r] > a[m] ? r : m; if (m != i) { swap(a, m, i); ++c; i = m; } else break; } while (true); return c; } static void heapSort(int[] a) { int n = a.length; int c = 0; for (int i = (n - 1) / 2; i >= 0; --i) maxHeapify(a, i, n); for (int i = n - 1; i > 0; --i) { swap(a, 0, i); c = maxHeapify(a, 0, --n); for (int j = 0; j < a.length; ++j) System.out.print(a[j] + " "); System.out.println("比较次数:" + (c + 1) * 2 + " 交换次数:" + c); } } }