-
joseph
用链表解决约瑟夫问题。
约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。
其中包括一个实验报告，介绍了编程思路和输出结果截图。(List to resolve Joseph. Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns. Including a lab report describes the programming ideas and output screenshots.)
- 2012-08-27 22:37:52下载
- 积分：1
-
POJ2371
PKU ONLINEJUDGE 2371
- 2011-10-21 15:03:03下载
- 积分：1
-
josephus
说明： 约瑟夫算法，适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)
- 2011-04-13 16:43:47下载
- 积分：1
-
LinearList
单链表程序 可执行单链表的基本功能 创建 删除 查找 存取 等等(Basic functions to create a single linked list program executable single linked list delete find access)
- 2012-10-31 17:15:54下载
- 积分：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
-
host2
说明： 马踏棋盘算法编程，实现在棋盘上任意两点间的最短路径求解。(horse riding chessboard programming algorithm to achieve on the chessboard arbitrary 2:00 of finding the shortest path.)
- 2006-04-30 00:12:21下载
- 积分：1
-
DBGRID-call-SQL-database
基于C语言的使用DBGRID控件实现的SQL数据库管理程序，方便灵活(C-based controls to achieve using DBGRID SQL database management procedures, convenient and flexible)
- 2013-07-13 21:30:03下载
- 积分：1
-
Poly
多项式相加的数据结构试验·············(Polynomial sum test data structure)
- 2010-12-24 15:11:55下载
- 积分：1
-
car
停车场管理系统 c语言实现
停车场拥有M个车位和一条进入停车场的便道，便道上最多停放N辆汽车。汽车要想进入车位，首先进入便道等候。若有空闲车位，则停车入位，否则在便道继续等候，直至有车位空出。若便道已经停满等候的汽车，后到达的汽车只能离开，选择其他停车场。设计一个停车场管理系统，模拟停车场的运作，并统计停车场的收入。(Parking Management System with M c language parking spaces and a sidewalk into the parking lot, parked up on the sidewalk N cars. To enter the car parking spaces, first into the pavement waiting. If free parking, the parking into place, or in the sidewalk to wait until the needed spot. If the sidewalk is already full of parked cars waiting, after the arrival of the vehicle to leave, choose a parking lot. Designing a car park management systems, simulation parking operations and parking revenue statistics.)
- 2011-08-21 21:55:11下载
- 积分：1
-
mapsearch
数据结构，关键路径问题，设计并实现关键路径的一种应用，采用图的算法(Data structure, critical path problem, using graph algorithm)
- 2016-01-09 17:34:45下载
- 积分：1
