搜索资源列表
minheap vs minleftisttree
- 这是一个用C++编写的代码,实现了最小堆和最小左偏树在插入删除元素性能方面进行比较. -This is a preparation of the C code, the smallest and youngest sculpture tree in the left side inserted delete elements performance comparisons.
MinHeap
- 算法与数据结构中，最小值堆的实现与运算。
Haffman
- huffman 算法 包含的主要个文件： minheap.h:初始化堆 haffman.cpp:具体实现huffman算法
2nd_chapter
- 《算法设计与分析》王晓东编著，第二章递归与分治策略课本例子代码实现- Algorithm Design and Analysis edited by Wang Xiaodong, chapter and sub-rule strategy recursive textbook example of code to achieve
MinHeap
- 最小堆实现方法，代码来自北大赵海燕老师编著的数据结构与算法。-Minimum heap method, code Zhao Haiyan teachers from Beijing University and edited by the data structure and algorithm.
HuffmanTree
- 文件包含HuaffmanTree.cpp，与头文件HuaffmanTree.h和MinHeap.h 编译后可生成哈弗曼树,是学习数据结构的很重要的基础-the file includes HuaffmanTree.cpp and HuaffmanTree.h and MinHeap.h
MinHeap
- 最小堆，实现相关函数 结构是线性，逻辑是树-Minimum heap structure to achieve correlation function is linear, logic tree
Heap-Sort
- This is Heap sort,can sort minheap and maxheap
TopKMax
- 找出一组数字中最大的K个数，用一个K大小的最小堆维护-Output top K numbers in an array using a minheap with heapsize equals to K
minheap
- 数据结构C++最小堆的实现，代码简单明了，实现了堆中元素的删除，插入，取堆顶元素等-The data structure of the realization of the least C, code simple and clear, realize the pile in the deletion of the elements, insert, take pile of top elements
MinHeap
- 用贪心算法的原理求最小堆 优先队列类，实现队列接口，使用最小堆存储队列元素，元素按优先级升序排列-Greedy algorithm for the minimum heap principles
heap
- 数据结构 最大堆 最小堆 C++ 代码 对于数据结构学习很有帮助-code of Maxheap minHeap
Huffman
- 利用最小堆实现霍夫曼编码，建立霍夫曼树，并且实现插入，删除，输出等功能-Use minheap to bulid the huffman tree