搜索资源列表
DEMO(sort)
- 实现各种内部排序。包括冒泡排序，直接插入排序，Shell排序，快速排序，堆排序，并比较排序的比较次数和移动次数。主要是C语言。-achieve internal order. Including bubble sort, direct insertion sort, Shell sort, quick sort, heap sort, and compare the ranking of number and mobile number. C is the main language.
Heap
- 堆排序算法，the heap sort algorithm
heap sort
- 堆排序算法的实现,不错的哦-heap sorting algorithm to achieve good oh
sort
- 数据结构上让我们编写的排序算法，有冒泡，堆排序等-Data structure so that we prepared on sorting algorithms, there are bubble, heap sort, etc.
HeapSort
- 利用窗体实现堆排序。并能逐一显示堆排序的过程-Using the form to achieve Heap Sort
sort
- 用JAVA语言实现的一些排序算法。包括冒泡排序、桶排序、基数排序、堆排序、插入排序、归并排序、快速排序、计数排序、选择排序。-JAVA language using some sorting algorithm. Including bubble sort, bucket sort, radix sort, heap sort, insertion sort, merge sort, quick sort, counting sort, selection sort.
Heap-sort
- 堆积排序(Heapsort)是指利用堆积树（堆）这种资料结构所设计的一种排序算法，可以利用数组的特点快速定位指定索引的元素。 -Heap sort (Heapsort) is the use of stacked tree (heap) data structure designed such a sorting algorithm can take advantage of the characteristics of the array elements quickly locate t
Heap-Sort
- This is Heap sort,can sort minheap and maxheap
HEAP-sort-program
- 堆排序程序，对结构体数按某个值KEY的大小降序排序-Heap sort program, the number of structures according to the size of a value in descending order KEY
Deformation-heap-sort-algorithm
- 变形堆排序算法实现与性能比较，算法第一次作业。-Deformation heap sort algorithm and performance comparison
Heap-sort
- 堆排序 MFC 显示初始化的堆和排序后的堆。-Heap sort heap and initialize MFC display sorted heap.
Heap-Sort
- 数据结构中所要了解及掌握的堆排序算法。-Data structure to understand and master of the heap sort algorithm. ~~~~~~
heap-sort
- 利用堆排序从一系列的数中找出前k个小的数-Using heap sort from a series of numbers to find a small number of the first k
heap-sort
- 堆排序算法的实现，很早写的，应该有点借鉴意义-Heap Sort algorithm, early writing, and should learn a little bit
Heap-Sort
- C++ implementation of Heap Sort
Heap-sort
- 堆排序 堆排序利用了大根堆（或小根堆）堆顶记录的关键字最大（或最小）这一特征，使得在当前无序区中选取最大（或最小）关键字的记录变得简单。 （1）用大根堆排序的基本思想 ① 先将初始文件R[1..n]建成一个大根堆，此堆为初始的无序区 ② 再将关键字最大的记录R[1]（即堆顶）和无序区的最后一个记录R[n]交换，由此得到新的无序区R[1..n-1]和有序区R[n]，且满足R[1..n-1].keys≤R[n].key ③由于交换后新的根R[1]可能违反堆性质，故应将当前无序区
heap-sort
- 利用系统生成随机数，然后将生成的随机数进行堆排序堆排序-heap sort
heap-sort-code
- c语言编写的堆排序算法，算法复杂度O(nlgn)-heap sort
Heap-Sort
- It is the source code of the Heap Sort in C++. which is a data structure.-It is the source code of the Heap Sort in C++. which is a data structure.
heap
- 利用C++实现了最大堆和最小堆的初始化，插入、删除操作，在此基础上实现了堆排序(On the basis of C++, the initialization, insertion and deletion of the maximum heap and the minimum heap are implemented. On this basis, the heap sort is implemented.)