资源列表
Diagonal-Matrix
- Make a diagonal matrix
Circle-Area-a-Circumference
- Calculate circle area and Circumference-Calculate circle area and Circumference
cpp
- 严蔚敏数据与结构第三章学生习题，关于堆栈和队列-Yan Wei-min data structure and the third chapter student exercises on stacks and queues
KMP
- KMP优化后算法，传统字符串检索复杂度大高，KMP算法虽然大大缩短时间仍存在缺陷，在于其NEXT数组，优化后解决了此问题-KMP algorithm optimized, big high complexity of traditional string retri , although KMP algorithm greatly reduces the time there are still defects, after its NEXT array, optimized to solve
superqueue
- 优先队列，区别于传统队列队首出队，而是按照优先级出队，比如键值的大小-Priority queue, the queue is different traditional first team out of the team, but in accordance with the priority of the team, such as the size of the keys
Bittree
- 二叉树遍历，包括了二叉树的建立，二叉树的层序遍历，先序遍历（递归非递归），中序遍历（递归非递归），后序遍历（递归非递归）-Traversing the binary tree, a binary tree comprising, the binary tree traversal sequence, first traversal (recursive non-recursive), inorder traversal (recursive non-recursive), postorder t
createtree
- 先序遍历，中序遍历建立二叉树。根据输入先序和中序遍历结果建立起二叉树。-Preorder, preorder binary tree. The results establish binary tree traversal sequence and the first input sequence.
FCM
- 用MATLAB实现的关于模糊聚类的算法，实验效果良好。-Using MATLAB to achieve the fuzzy clustering algorithm, the experimental results are good.
Projects2
- 部分数据结构C++实现，包含一些做实验的源程序-Data structure C++ implementation, including some of the experimental source
kmp
- KMP算法实现，一个主串内到底包含了多少个从串-KMP algorithm to achieve a main string in the end contains a number of the string
Set
- Set集合数据结构的运算Visual C++定义的集合数据结构-Set
algo_project2
- 算法基础课程 实验报告 中国科学技术大学 算法实验二 算法导论-Basic Course algorithm algorithm experimental report two experiments, University of Science and Technology of China