搜索资源列表
huffman_f
- huffman_f 在huffman_e的基础上，将排序改为利用堆排序原理选择最小的两个权值。也即，将所有元素的权值组织成堆后，每次堆内的根结点就是最小值了。每取出一个根结点后，就把堆尾元素调到根结点重建堆。取出两个最小值合并成一个子树后，再把子树作为叶子结点放到堆中，并让其上升到合适的位置，保持堆性质不变。因为每次不必完成整个排序过程，而只是组织成堆，因此，这种方法要比使用快速排序更快。上述算法参考了mg-1.2.1中Huffman编码的实现，见http://www.cs.mu.oz.au/m
dspwork
- 一堆数字信号处理的小程序,打个包发上来,上数字信号处理课写的,包括复倒谱、傅立叶变换、各种滤波器等~-heap of digital signal processing procedures for small, one packet onto fat, digital signal processing course was made, including the complex cepstrum, Fourier transform, various filter ~
Huffman
- 迄今为止见过的最方便的huffman编码，效率很高 一个外国人写的，很具有研究价值 Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1). 2) Set
Example3D
- 更新的这个C++代码范例演示了一个简单3D引擎。显示屏上所有可见内容都用Open GL ES作了3D渲染；如果终端支持的话该范例也支持硬件加速。这个应用支持S60 3rd Edition及后续版本，可适应不同屏幕尺寸和显示方向。经过更新的这个版本提供了加强的纹理载入并增加了堆与栈的大小。可以从诺基亚论坛网站下载支持S60 2nd Edition和Series 80 2nd Edition的独立范例。主要的类有：OpenGL ES (API), CIdle, Math, CImageDecoder
1
- 对文字的识别，能快速地堆文字进行分离识别-Identification of the text, the text can be separated quickly identify the heap
Graph-class
- This a simple Graph header class, Heap and Vertex Classes are 2 necessary classes which all are compressed in a single rar file.-This is a simple Graph header class, Heap and Vertex Classes are 2 necessary classes which all are compressed in a single
TankWorld_OpenGL-2.0
- 这是我从一个由pascal语言opengl1.0编写的坦克射击游戏移植而来。 先移植为C++。尔后由于工作需要，又将其移植为纯C语言opengl2.0 的代码。代码通用与WIN32项目和中间件 以及机顶盒中。上传的这个工程是WIN32上调试用的。 由于部分特殊要求，游戏中的所有资源文件在本版本中全部都被转化为头文件包含形式，不再有对文件的操作，详情看到代码即可了解。 -----注意---- 代码是VC6.0环境下编译运行，但由于转变为.h的资源文件过大，VC6.0下会出现
Graph-class
- This a simple Graph header class, Heap and Vertex Classes are 2 necessary classes which all are compressed in a single rar file.-This is a simple Graph header class, Heap and Vertex Classes are 2 necessary classes which all are compressed in a single
LeftistHeapMain
- create leftist heap using java program
EppsteinAlgorithm
- The algorithm developed by Eppstein not looking for simple paths. In Indeed, the paths returned by the algorithm may contain rings or loops. It applies only on graphs where the weights are positive. This algorithm is based on extensive use of h
stu
- C++实现图像的镜像，灰度化，图像的旋转等功能-C++ data structure operations, including sorting, and search, selection, bubble, heap sort and quick sort, binary search to find and order
2236469
- Merge, Insertion, Radix, Heap, Bucket, Quick, Counting排序算法()
43646550
- 堆排序算法,the heap sort algorithm()
589508
- 排序 得分排行 x擇,插入,氣泡排序 Shell 排序法 - 改良的插入排序 Shaker 排序法 - 改良的氣泡排序 Heap 排()