资源列表
hh
- 用递归实现二叉树的先序,中序,后序3种遍历.-Binary tree with recursive realization of the first order, in sequence, the latter three kinds of traversal sequence.
quickSort
- 快速排序的算法,只需要实现对应的接口就能对各种对象排序.-Quick sort algorithm, only need to implement the corresponding interface can be sorted on various objects.
kmp
- KMP算法一种实现。效率相对较高。简单实用。-An implementation of KMP algorithm. Efficiency is relatively high. Simple and practical.
DNAsort
- PEK1007 北京大学ACM1007题
joseph
- 编号为1,2,...,n的n个人按顺时针方向坐在圆桌边, 每人持有一密码(正整数),从第s人开始报数, 报到第m人出列, 再从下一人开始报, 直至所有的人都出列为止-Joseph Central C-list resolution process www.firnow.com Time: 2008-01-26 Author: Unknown Editor: andyyoo Views: 1557 [review] comprehensive resource bo
verifyMsisdn
- 给定N*N字母矩阵，从任意点出发，上，下，左，右移动，在规定方向连续匹配给定的单词序列。即称为命中，否则不命中，字符矩阵中的字母仅能使用一次，不能在同一单元格停留两次。字符矩阵最大50*50，都为大写字母。输入1为字母矩阵，输入2为字母序列，输出是否匹配。-Given the letter N* N matrix, starting from any point, up, down, left, right, match the prescribed direction of the conti
josephus
- C++约瑟夫问题采取链表实现任意输出 链表实现-josephus problems
EKG
- 使用动态规划高效求解EKG序列。EKG序列现在在质数研究方面有着非常重要的意义，而且EKG序列在医学等方面也有应用。-To get the EKG sequence.
HaffmanTree
- 哈弗曼树的建立和实现,方法选取一个权值最小和一个权值次小的结点来构成一个新的父母结点，递归建立一颗哈夫曼树-Hafu Man tree establishment and realization of the method to select a right to the minimum value and a weight value of small nodes to form a new parent node, recursive establish a Huffman tree
Stack
- 使用堆栈来测试输入的字符串当中括号是否匹配-Use the stack to test whether the input string which matched parenthesis
reverse
- 本实验设有一个线性表，分别实现数组结构存储的原地逆置。为数据结构课程必做实验。-This experiment has a linear form, respectively, to achieve the storage array structure in situ reverse home. For the data structure courses will do the experiment.
distribution_judge
- 判断数据处于什么分布状态，有些数据参数需要自己设定-Determine what data is distributed state, some data parameters need to set their own