堆排序(HeapSort)是一树形选择排序。堆排序的特点是：在排序过程中，将R[l..n]看成是一棵完全二叉树的顺序存储结构，利用完全二叉树中双亲结点和孩子结点之间的内在关系(参见二叉树的顺序存储结构)，在当前无序区中选择关键字最大(或最小)的记录-Heap Sort (HeapSort) is a tree selection sort. Heap sort is characterized by: the sort process, the R [l.. N] as a complete b

HeapSort. HeapSort is the first of these methods, the performance of which is estimated as O (n log n).

堆排序实现，输入数组大小和数组序列（空格分隔），输出升序降序排列。-heap sort

Input 1000 data with random function as the input data, then implement the sorting algorithms with Straight insertion sort algorithm, Straight selection sort algorithm, quicksort algorithm, bubble sort algorithm, and heapsort algorithm And compare th