资源列表
a_linear_form_of_different_storage_structures
- 哈尔滨工业大学，计算机科学与技术学院，数据结构，作业二：实现线性表的不同存储结构-Harbin Institute of Technology, Computer Science and Technology, data structure, operating 2: To achieve a linear form of different storage structures
threaded_binary_tree_and_its_traversal
- 哈尔滨工业大学，计算机科学与技术学院，数据结构，作业三：二叉树的线索化及其遍历-Harbin Institute of Technology, Computer Science and Technology, data structure, operating three: threaded binary tree and its traversal
minimum_spanning_tree_construction_algorithm
- 哈尔滨工业大学，计算机科学与技术学院，数据结构，作业四：最小生成树的构造算法-Harbin Institute of Technology, Computer Science and Technology, data structure, operating 4: minimum spanning tree construction algorithm
AVL_tree
- 哈尔滨工业大学，计算机科学与技术学院，数据结构，作业五：AVL树相关操作实现-Harbin Institute of Technology, Computer Science and Technology, data structure, operating 5: AVL tree-related operations to achieve
bank
- 操作系统汤子赢版，按书上写的银行家算法以及老师的示范程序-TANG Zi-winning version of the operating system, according to books written by banker' s algorithm, as well as the teacher' s demonstration program
mtqp
- 马踏棋盘的C算法,数据结构,堆栈的学习,算法分析,贪婪算法-Horse riding board C-algorithms, data structures, stack, learning, algorithm analysis, greedy algorithm
prolog
- 用Prolog写的一些基本函数，如compress, decompress, pack, gcd, duplicate, sort-Some fundamental functions written in Prolog, such as compress, decompress, pack, gcd, duplicate, sort.
JOSEPHUS
- 著名的约瑟夫环问题，采用链表数据结构 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。 例如：n = 9, k = 1, m = 5 【解答】 出局人的顺序为5, 1, 7, 4, 3, 6, 9, 2, 8。-well-known Josephus Problem,using link list method
dbPoint.c
- C语言实现，分治法求平面中任意个点的最近点对和最近距离。-C language implements, find out the shortest point pair and the shortest length between arbitrary points in a plane, with divide and conquer method.
FibIterative
- This is fibonacci code in an iterative method done by c
quan
- 排序，是数据结构中的基本算法，在每以个课本中都能找到-this
chazhao
- 此程序书用VC开发的数据结构里的查找算法，有更新二叉树，查找结点，增加结点，删除结点等功能-This program developed in the book with the VC data structure where the search algorithm, an updated binary tree to find nodes to increase the node, delete node functions