资源列表
Josephe2
- 数据结构中经典的约瑟夫问题的解决算法。简单易懂-Data structure in the classical algorithm to solve the problem of Joseph.
src
- 递归求解众数问题，所谓众数问题就是给定一个含有n个元素的多重集合S，每个元素在S中出现的次数称为该元素的重数，S中重数最大的元素称为众数。-failed to translate
NCoinsProblem
- n枚硬币问题，采用分治法中的三分算法，很好的解决了n个硬币的问题-n coins problem, using divide and conquer algorithm in the third, a good solution to the problem of n coins
CIRCLE
- bresenham算法画圆，并实现圆的填充。-bresenham algorithm circle, filled circle and to achieve.
ENC28J60_vd1
- TCP/IP use test ENC28j60 chip.
1316-How-Many-Fibs
- HDU ACM 1316 Problem Descr iption Recall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n >= 3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a, b].
qishizhouyou
- 骑士周游是一个经典的问题，它需要回唆的办法来解决-Knight s tour is a classic problem, it needs to return to instigate solutions to
prim
- 数据结构课程设计，prim算法求最小生成树，给出了所有可能的生成树-Data structure course design, prim algorithm for minimum spanning tree, has given all the possible spanning tree
数据结构的课程设计
- 大二时做的一个数据结构的课程设计，用2-3树实现的图书馆管理系统，只是控制台程序，没有很好的图形界面。包括管理员、读者。管理员功能有：采编入库、查看图书、查看读者、删除读者。读者功能有：借书、还书、预约、查找等等。。功能全面。包括注册账号，登录需要账号密码。-Sophomore to do a data structure of the curriculum design, with 2-3 tree implementation of library management system, bu
juzhen3.1
- 动态规划解决矩阵连乘问题 算法设计与分析实验题-With dynamic programming to solve the matrix multiplication problem
test1
- map映照容器的元素数据由一个键值和一个映照数据组成的，他也是采用红黑树实现，插入元素的键值不允许重复，默认从小到大排-Map of the container element data from the shine upon a key value and a mapping data of composition, he is also using red and black tree realization, the elements of the key value not allowe
blocks
- 控制台版的俄罗斯方块程序，开发环境是vc6.0，效果非常棒~-A Russian-blocks program based on console programming, developed in the VC++6.0, with a fantastic performance~