搜索资源列表
LAB03_10389355_2
- 排序算法的性能分析，4种排序：选择排序，名次排序，插入排序，冒泡排序，其中插入和选择还用了链表实现法-all sort
Student-management-system
- 链表实现的学生管理系统，还有查看，添加，删除，查询，退出功能-Student management system implemented by the linked list, as well as view, add, delete, query, exit function
Josephus-realizationagt
- <约瑟夫环的实现>采用线性链表实现 可以进行线性表元素的动态插入和删除-< Josephus realization> linear list can be linear table elements dynamically insert and delete
2009125146
- 对链表实现冒泡法排序，链表的冒泡法排序实现-Bubble method to sort a linked list implementation of the list, the sort of bubbling method
student-manage-system
- 用户根据需要添加、删除、修改、获取学生信息。使用链表实现-Users to add, delete, modify, access to student information. Using a linked list implementation
Double_Link_Notebook
- 双链表实现的多功能电话本，C++实现的，亲自测试过，没有问题，在VS2008下编译运行-Doubly linked list implementation of the multi-function phone book, achieved by C++, personally test, no problem, compile and run under the VS2008
queue
- 用C语言的链表实现队列和一些对队列的操作，如插入删除读取等。-C language linked list, queue and queue operations, such as the insertion delete read.
Tree
- 树类，孩子父母链表实现树的操作
List-of-application
- 数据结构课程设计 链表应用应用链表实现对数据的插入，删除，查找，排序。-A student achievement management system, uses linked list for data inserting, deleting, sorting and querying, C-C.
Lhheap_dji
- 使用堆+链表实现dijksttra,求单源最短路可直接使用。 -The heap+ linked list dijksttra seeking single-source shortest path can be used directly.
employee-information-system--
- 用链表实现员工信息系统，通过链表实现 通讯录编辑（添加、删除）； 查找； 排序； 将通讯录写入文件； 从文件读入通讯录。-Employee information system, a linked list, address book editor through the list (add, delete) search sort contacts write to a file read from the file into the address book.
student
- C语言开发的学生成绩管理系统,使用单向链表实现。-student score management system
yuesefuhuan
- 约瑟夫环的代码，用循环链表实现约瑟夫环。。主程序和循环链表都有-Josephus code
Josephus
- 约瑟夫环问题 数据结构经典算法 链表实现-Josephus problem
7-MIS
- 用链表实现，学生信息管理系统，多菜单选择-student MIS
Joseph-problem
- 利用循环链表实现约瑟夫问题的求解。 约瑟夫问题如下：已知n个人（n>=1）围坐一圆桌周围，从1开始顺序编号。从序号为1的人开始报数，顺时针数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规则重复下去，直到所有人全部出列。请问最后一个出列的人的编号。 -Circular linked list Joseph problem solving. Joseph questions are as follows: Given n individuals (n>
CourseMS
- 本工程使用双向循环链表实现课程管理系统，可以实现任意位置查找，任意位置删除，归并两个有序链表等等功能函数。对初学数据结构的同学很有帮助。-This project uses two-way circular linked list course management system, you can achieve any position to find and delete any position, merge two ordered linked lists and so on funct
1stWork
- 利用链表实现目录的顺序输出，提供新建、删除文件（夹）操作-Using linking list to print directory, and to provide new, delete files (folders) operations
0410210
- 密码机 （多使用链表实现）---可作为数据结构课设-Cipher machine (multi-use linked list implementation)--- can be set as a data structures course
library
- 图书管理系统是用链表实现的 它灵活 实用欧冠，界面简洁 通俗中透露出大智慧-It is a library management system . you will find how smart it is . just have a try ,you will win a great harest.