资源列表
testconsole
- 关于数据结构的各章节的c原代码实现，还包括4主人4仆人过河等问题的求解等（全部经过上机验证过）-On the data structure c of all sections of the original code, but also including 4 masters 4 servant to solve such issues across the river, etc. (all through the machine verified)
8222631
- 一种bss盲源信号分离的工具包 可以用于盲信号的提取 不错的-A toolkit of BSS signal blind source separation Can be used for the extraction of fanaticism, good
CanBSS
- 一种bss盲源信号分离的工具包 可以用于盲信号的提取 不错的-A toolkit of BSS signal blind source separation Can be used for the extraction of fanaticism, good
rxtsactiodused
- 一种bss盲源信号分离的工具包 可以用于盲信号的提取 不错的-A toolkit of BSS signal blind source separation Can be used for the extraction of fanaticism, good
9、Hash表应用
- 散列表（Hash table，也叫哈希表），是根据关键码值(Key value)而直接进行访问的数据结构。也就是说，它通过把关键码值映射到表中一个位置来访问记录，以加快查找的速度。这个映射函数叫做散列函数，存放记录的数组叫做散列表。(A hash table (Hash table, also called hash table) is a data structure that accesses directly according to the key code value (Key val
StackEx
- 这是关于栈的功能实现及验证的小程序，这个程序在学习数据结构是会有帮助。-This is a stack of functions and validation procedures, this procedure in the study of data structures it would be helpful.
Greedy-algorithm
- 贪心算法一般来说是解决“最优问题”，具有编程简单、运行效率高、空间复杂度低等特点。-Greedy algorithm to solve general, " optimal problems" , with programming is simple, efficient, and low space complexity.
txsf
- 一个KM算法,很实用的，大家好好学习天天向上-a general prime
e
- 实现二叉树的基本操作：建立、遍历、计算深度、结点数、叶子数等。-Binary tree basic operations: the establishment, traverse, calculate the depth, the number of nodes, number of leaves and the like.
index
- 用于数据结构的文件索引，关键字放在一个文件中 相当于一个词典-Data structure used to index the documents, keyword in a document equivalent to a dictionary
FomulaStack
- 利用栈求解算术表达式的值，程序分为两种表达式，中缀式与后缀式，分别得用栈先入后出的特性，以及运算符的优先级比较，进行求解-use arithmetic to solve the value of the expression, procedures are divided into two expressions, and the sergeant-type suffix. Stack were starting after the first-in-the characteristics, a
Queen-of-the-board
- 皇后棋盘算法和C++程序实现。横行纵行斜行不能摆两个以上的皇后。-Queen board algorithms and C++ Program. Transverse oblique longitudinal Queen can not put more than two.