搜索资源列表
heap-sort
- 利用堆排序从一系列的数中找出前k个小的数-Using heap sort from a series of numbers to find a small number of the first k
heap
- 堆的插入、删除、查找、建立等操作，简单能用就行了-Heap insert, delete, find, build, etc, can be used simply on the line ......
heap
- 这是关于heap的程序，他可以实现heap的插入 删除 保存 输出等-this programming can realize the function of the heap ，include the insertion new element of the heap， delete the root element of heap，the function of heap sort ，and print the deleted
heap-sort
- 堆排序算法的实现，很早写的，应该有点借鉴意义-Heap Sort algorithm, early writing, and should learn a little bit
Heap
- Heap Class based on binary Tree. Used in many programs.
binomial-heap
- program to implement a binomial heap and do operations like insertion, extracting the minimum key node, decreasing the node key etc
heap
- python语言的一个脚本，用于获取当前系统的堆结构-python heap
Heap-Sort
- parallel prog for heap sort
heap
- To write a heap in assembly language (X86)
heap
- 堆（构造大顶堆、弹出元素、插入元素、堆排序）-heap(the structure of the heap, pop-up elements, and heap sort)
HEAP
- 大顶堆及优先队列的完整实现，包括插入、改变、抽出元素的实现以及实现堆排序。-The big top of the heap and priority queue complete implementation, including insert, change, taking the elements of the implementation and realization of the heap sort.
Heap-Sort
- C++ implementation of Heap Sort
safe-heap
- safer heap-allocate strategy
safe-heap
- safer heap-allocate strategy
Heap
- 最小堆的实现 最小堆的创建、调整、插入和删除算法，运用C++类实现最小堆的类定义及基本操作算法 -Minimum heap to achieve the minimum heap to create, adjust, insert and delete algorithms use C++ class to class definition and the basic operation algorithms to achiev
Heap
- The program represents a graphical representation of heap sort.The program is in accordance to algorithm provided in Cormen
heap
- 二叉堆的操作。包括最大堆和最小堆的建立与调整。-Binary heap operations. Including the largest heap and the establishment and adjustment of the minimum heap.
Binary-Heap
- 二叉堆的基本介绍，以及相关的简单源码实现-Introduction of binary heap, and a simple implementation
heap
- 简单的内存堆管理，模拟操作系统，实现简单的内存分配和回收。-Simple memory heap management
Heap-sort
- 堆排序 堆排序利用了大根堆（或小根堆）堆顶记录的关键字最大（或最小）这一特征，使得在当前无序区中选取最大（或最小）关键字的记录变得简单。 （1）用大根堆排序的基本思想 ① 先将初始文件R[1..n]建成一个大根堆，此堆为初始的无序区 ② 再将关键字最大的记录R[1]（即堆顶）和无序区的最后一个记录R[n]交换，由此得到新的无序区R[1..n-1]和有序区R[n]，且满足R[1..n-1].keys≤R[n].key