-
shopping-question
实现超市中排队购物用时最短，是计算机算法设计与分析中的一道题。自己写的程序，原创！(Achieve queued supermarket shopping with the shortest, is a question in the design and analysis of computer algorithms. Write their own procedures, original!)
- 2012-08-18 11:01:09下载
- 积分：1
-
Hash
基于Hash表的程序同源性分析,可以利用本程序进行两个程序源码比较相似度(Homology analysis Hash Table-based program, you can use the program two program source code similarity)
- 2012-11-04 16:45:04下载
- 积分：1
-
yuesefuhuan
使用VC编写的约瑟夫环程序，简单明了，方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)
- 2009-09-08 16:45:26下载
- 积分：1
-
crox
矩形件最优排样的程序,用Visual C编写，在6.0下能正常运行。(Rectangular pieces Optimal Nesting program)
- 2013-05-13 14:31:41下载
- 积分：1
-
FIFO-c
说明： 操作系统先来先服务调度算法模拟（C描述）(Operating a first-come first-served scheduling simulation (C description))
- 2010-04-13 00:02:35下载
- 积分：1
-
Dijkstra
迪杰斯特拉算法，数据结构，C语言写的，上大学计算机系会用到的。。。(Dijkstra algorithm, data structures, C language written on the Department of Computer Science will be used. . .)
- 2013-03-06 21:50:34下载
- 积分：1
-
Czhihen
关于C语言的一些指针的处理算法，能够使得初学者对C语言指针有自己的了解(Some pointers on C language processing algorithms, it is possible to make a beginner C language pointer has its own understanding)
- 2016-06-17 11:29:59下载
- 积分：1
-
Dynamic-Memory-Allocation
这个程序是有关计算机的动态内存分配的数据结构 可以直接加载头文件与源文件即可使用其中的接口(This program is a data structure for dynamic memory allocation of the computer can directly load the header files and source files you can use one of the interfaces)
- 2012-05-22 16:36:13下载
- 积分：1
-
0728-0708-0704
北邮数据结构课程设计大作业之旅行模拟查询系统。可实现多线程多旅客、中途更改计划、动态显示旅客状态等多个需求。已通过验收。(BUPT curriculum design travel query system simulation of large operations. Multithreading enables passengers to change plans midway, dynamic display multiple demands guest status. It has passed inspection.)
- 2021-03-14 12:09:23下载
- 积分：1
-
fast_sort
/*快速排序：以待排序元素中的第一个元素作为基准将带排序的元素分为三组
*大于基准元素为一组置于基准值的右边，小于基准值的元素为一组置于基准值的左边，
*基准值为一组，这样就找到了基准元素的位置就确定了
*如此递归调用。直到每一组的low==high，即实现了排序的要求。
*/
(/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
- 2012-10-26 21:42:43下载
- 积分：1
