资源列表
chazhao
- 数据结构3种查找算法的比较。输出其平均用时。-Comparison of three kinds of lookup data structure algorithms. The output of its average time.
Trees-storage-with-BitTree
- 利用二叉树形式存储树或森林，然后进行中序遍历访问该二叉树。-Using binary tree to store tree or forest, and travel it.
yuesefuhuan
- 数据结构实验课作业—约瑟夫环实验。使用链表完成实验。-Experimental data structure Homework- Josephus experiment. Use the list to complete the experiment.
Fibonacci-sequence
- 此程序为C++语言的程序，可以输出斐波那契数列，特点是采用线性表的数据结构处理加法运算，对每一位数进行运算，并进位，解决了由于int或long int甚至unsigned long int(0~2^32-1=4294967295)的精度范围限制，此算法的精度范围主要受项数n(int)的范围(1~2^31-1=2147483647)影响-This program is C++ language program, you can output the Fibonacci sequence, is c
Djstla
- 用C语言实现了Djstla 最短路劲算法。算法采用codeblocks编程。文件包含了编译好的可运行的工程，同时也给出了一些测试数据。-Using C language to implement Djstla shortest strength algorithms. Algorithm codeblocks programming. File contains the compiled to run the project, but also gives some test data.
library-management-system
- 实现了图书馆管理员的增删改查等操作，学生和老师的借还书操作-Realized the librarian to add and delete operations, such as students and teachers borrow return book operation
suanfa
- 算法实验矩阵连乘问题，八皇后问题，骑士游历问题，字符串插入“+”，求最大利润的动态规划和回溯算法-Experimental matrix multiplication algorithm even question the eight queens problem, Knight traveled problem, the string is inserted " +" , seeking to maximize profits and backtracking dynamic
Hash-table
- 本代码主要实现了哈希表的设计，完成了哈希函数的相关要求。-The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.
polynomial-coefficient-matrix
- 一元系数多项式矩阵计算器，实现一元矩阵加减-One yuan polynomial coefficient matrix calculator, to achieve a dollar matrix subtraction
Binary-Tree
- 实现唯一的确定一棵二叉树，该方法相对简单方便。-Achieved only determine a binary tree, the method is relatively simple and easy.
tushuguan
- 主要实现西文图书馆智能问题。采用数据结构来实现。-The main achievement of Western Libraries intelligent questions. Using the data structure to be achieved.
huisufa
- 把长度为l1,l2…ln 的n个程序放在磁带T1和T2上，并且希望按照使用最大检索时间取得最小值的方式存储，即如果存放在T1和T2上的程序集合分别为A和B，则希望所选择的A和B使得max{∑li 1,∑li2}(i1属于A，i2属于B)取得最小。 使用回溯法实现。-The length l1, l2 ... ln n programs on the tape T1 and T2, and want to use the maximum search time in accordance wi