资源列表
dancinglink
- This a program to implement the so-called \"dancing link\" which is introduced in Knuth s paper. This is really a super acrobatic and I am sure that not many programmers can understand the algorithms. -This is a program to implement the so-c
MD5suanfaJavaBeanMD5
- MD5算法Java BeanMD5，希望大家参考学习，相信您会有所收获-Java BeanMD5 MD5 algorithm, we hope to learn information, I believe that you will gain
acjanchan
- 2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input One positive integer on each line, the value of n. Output If the minimum x exists, print a line with 2^x mod n = 1. Print 2^?
jiangshangfei
- 该程序用于进行多项式的四则运算，其中抽象数据类型主要有栈和结构 -the procedures for conducting the four polynomial operations, which mainly abstract data type and structure of a stack
GREEDYSELECT1
- 这是一个会议安排问题,知道没个会议的开此时间跟结束时间就可以求要求的最少会议室 理论基础是谈心算法-This is an organization of the session, know that the meetings did not set a time to the end of time can be the minimum requirement in order Conference Room theoretical basis of the algorithm for he
ccccccccctc
- n牛的c语言经典例题，学好c语言在此一举-n cattle classic example c language, learn the language c one stroke
card24
- 可以进行分数的24点运算的，因为里面还额外实现了一个分数类。24点必须用VC编译，GCC编译会有问题，这个bug当时没找出来。可能是默认堆栈大小的问题。这个程序从我现在看来，写得很差。-can score 24 points in computing, because it has achieved an additional category scores. 24 points to be compiled with VC, the GCC compiler will create probl
tr96013[1].ps
- 关于steiner介绍，中间有ps格式，可以把其转为pdf格式-on STEINER, middle ps format can be converted to look at the pdf format
AprioriC++
- 用c++编写的apriori算法，数据挖掘的经典算法，但需要扫描多次数据库，已逐渐被fpgrowth代替-prepared with the algorithm algorithms, data mining algorithms classic, but need to scan multiple databases, have gradually been replaced fpgrowth
FSofGragh
- 图论中关于简单无向图的深度，广度搜索，由图形界面简单方便的演示。-on graph theory to a simple map with the breadth, depth search by the graphical interface is simple and convenient to the demonstration.
jianshanfei
- 该程序实现图的建立与先深和先广遍历，图采用矩阵存储，在遍历过程中用栈实现，但若改用队列，将会实现得更自然流畅-the program plans to establish the first and the first deep-Traversal, map storage matrix, Traversing in the process of making Stack, but switch queue, there will be more natural and fluid
all_kinds_of_algorithms
- 常用算法如西尔排序 堆排序 冒泡排序 选择排序等-common algorithms such as Silvan ranking Heap Sort Bubble Sort Selection Sorting etc.