资源列表
shuju
- 这是一个基于数据结构的代码，包含了算法和相关结构的实现过程-This is a code based on the data structure，which Contains algorithms and related structures
myLab3_final
- Base Class 和 Inheritance Class的应用，加入了单链表，可以实现用链表修改Class之中的内容-The application of base class and inheritance class, single linked list is added in the program, we can use it to change the data in the linked list
Maze
- 主要利用C++语言写的不相交集，来实现随机生成的一个三角形迷宫，并允许用户指定迷宫的入口和出口-The program is mainly about using the disjoint set in C++ to write a triangular maze randomly and allowing the user to specify the exit and entrance
1
- 已知先序和中序或者中序和后序，恢复二叉树，并输出-Known first sequence and the sequence or the sequence and the order of restoration of a binary tree, and output
student-management
- 数据结构的典型程序，班级人员信息管理。是学习的一个很好的材料-The typical procedure of the data structure, class information management. A good material for learning
search
- 数据结构中的几种重要的查找算法 有二叉查找/顺序查找-Several important data structures in the search algorithm, binary search, sequential search.
dijkstra
- DIJASTRA算法，是一种用处广泛的数据结构里的重要算法。-DIJASTRA algorithm is an important algorithm in a wide range of useful data structures.
PageProcedure-
- 模拟页式存储器管理程序（包含最佳置换、先进先出置换、最近最少使用置换算法）-Analog page memory management procedures (including the best replacement FIFO replacement, the least recently used replacement algorithm)
hush-Similarity-statistics
- 利用hush算法统计c语言程序的相似度，以检查两个c程序是否有相互模仿的嫌疑-hush Similarity statistics
Josephus
- 有n个人围坐在一个圆桌上，每个人的编号分别为1,2,3…n,现从第一个人开始数，数到第m个人时，这个人出列，再从下一位其编号是出列的人编号的后一位开始重复上述操作直到所有人都出列（编号是循环的，及最后一位的下一位是第一位），编写一个程序试将出列人的编号依次输出。-A n personal sitting around a round table, each person s Numbers were 1, 2, 3... N, now from the first person start to
an-array-of-linked-lists
- 数据链表的基本实现，包括用数组模拟建立一个链表，求长度，遍历及在指定位置插入以及删除数据。-The basic implementation of the data linked list to create a linked list using an array of analog and length, traverse and insert, and delete data in the specified location.
migong
- 迷宫问题 一个迷宫可用上图所示方阵[m,n]表示，0表示能通过，1 表 示不能通过。现假设耗子从左上角[1,1]进入迷宫，编写算法，寻 求一条从右下角 [m,n] 出去的路径-Maze A maze of available shown on the square [m, n], 0 through a table Means you can not pass. It is assumed that the mouse from the upper left corner [