资源列表
Red_Black_Tree
- 本程序中提供了对红黑树这一重要数据结构的完整实现以及各种操作-the procedures provided by the RED-BLACK TREE this important data structure to achieve the integrity of various operational
fib序列
- 数据结构算法：使用循环队列，K阶斐波那契数列的一种算法实现。-algorithm data structure : the use of recycled cohort, K bands Fibonacci series, a method.
01背包问题
- 采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~-used Branch and Bound France 0 / 1 knapsack problem! I practice on the machine operations, acceptance by the teachers, qualified! In view of the attachment on the machine for students to the
模式匹配
- 用C语言编写的一个简单的数据结构算法.可实现括号的模式匹配.-C language of a simple data structure algorithms. Brackets can be realized pattern matching.
dataS2
- 数据结构综合实验,有各种排序算法和计算排序时间,最短路径算法,huffman编码解码.用图形界面实现.在jbuilder2006下运行通过.-comprehensive experimental data structure, various sorting algorithm and sorting time, the shortest path algorithm, Huffman encoding and decoding. Using a graphical interface to a
Access password
- access密码破解程序, 利用VB写的ACCESS数据库密码破解程序。效果极好。-access password cracking program written in VB ACCESS database password cracking program. Very effective.
关于编译原理课程讲义cth
- 好的学习资料编译没学好的要下了看看哦 ,我也是找老师要的-good learning information to the compiler diminish under a look at, oh, I also want to find teachers
成绩输出
- 知道成绩表，按分块查找法查找学号为几的各科成绩，索引表分3块。-know its performance, by the sub-block search, law school to find several branches achievements, indexing table three points.
VB数组运用
- 一些ＶＢ中数组运用的例子，囊括了ＶＢ数组的大部分知识点．可供参考和调用．-some VB examples of the use of the array, the array includes most of the VB knowledge point. For reference, and use.
折半查找
- 数据结构二分查找，演示了使用递归函数或者循环语句实现的二分查找算法，两种方法都使用了称为二分搜索的算法-data structure search for two hours to demonstrate the use of recursive function or loop is the realization of two searching algorithm, both methods are used as a two-Search Algorithm
赫夫曼编码
- 用delhi做的程序实现了哈夫曼编码，做的还不错。-DELHI do with the program of Huffman coding, so good.
递归算法快速排序
- 分而治之方法还可以用于实现另一种完全不同的排序方法，这种排序法称为快速排序（quick sort）。在这种方法中， n 个元素被分成三段（组）：左段l e f t，右段r i g h t和中段m i d d l e。中段仅包含一个元素。左段中各元素都小于等于中段元素，右段中各元素都大于等于中段元素。因此l e f t和r i g h t中的元素可以独立排序，并且不必对l e f t和r i g h t的排序结果进行合并。m i d d l e中的元素被称为支点( p i v o t )。图1 4