利用堆排序排序算法對一個元素個數(shù)不少于20的隨機序列進行排序，輸出每趟排序的中間結(jié)果和每趟中關(guān)鍵字的比較次數(shù)和元素的移動次數(shù)。

【專家解說】：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]; //這里是我輸入的數(shù)組長度。所以產(chǎn)生出的a.length就會等于x // int[] a = new int[20]; System.out.println("數(shù)組元素個數(shù)為："+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("比較次數(shù):" + (c + 1) * 2 + " 交換次數(shù):" + c); } } }