搜索资源列表
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 achieve the minimum heap
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.
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 ③由于交换后新的根R[1]可能违反堆性质，故应将当前无序区
Heap-spray
- Heap spray经典技术资料 Heap Feng Shui in Javascr ipt_en_cn.doc bh-eu-07-sotirov-WP.pdf-Heap spray
binary--heap
- 二叉堆的实现 ，可以为数据结构的学习者，提供一个良好的借鉴-Binary heap implementation, provide a good reference for the data structure learners
Binary-Heap
- 二叉堆的基本介绍，以及相关的简单源码实现-Introduction of binary heap, and a simple implementation
max-heap
- max heap sorce code and it is good
heap-sort
- heap sort and it is good
Heap
- 数据结构中 相对麻烦的堆排序 算法及其 具体的实现 -Data structure relatively trouble heap sort algorithm and its concrete realization
HEAP
- Heap method using sort that arrange values