-
FinalExam
C语言期末考试题,含答案。数组、链表、函数等的使用和C编程。(failed to translate)
- 2011-11-07 20:07:25下载
- 积分:1
-
quicksort
数据结构快速排序例程代码,只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)
- 2013-05-23 15:05:53下载
- 积分:1
-
BinarySearchTree
在Visual Studio 2008运行成功 数据结构 二叉查找树的类(In Visual Studio 2008 running a successful binary search tree data structure classes)
- 2013-07-23 22:04:29下载
- 积分:1
-
paixu
实现冒泡,快速,希尔排序法。并计算,比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)
- 2012-05-21 22:13:12下载
- 积分:1
-
chessboard-distance
一道poj上的问题的解答,棋盘上的距离问题。即实现棋盘上从一个点移动到王,后,兵之间最短步数的解答。(A poj answers to your questions on the chessboard distance problem. That is, move from one point to the king on the board, after the shortest number of steps between the soldiers answer.)
- 2012-06-20 10:10:45下载
- 积分:1
-
strap_down_inertial_navigation
说明: 捷联系统C语言实现算法,已经过实验验证。(SINS C language algorithm, has been verified by tests.)
- 2008-11-20 16:50:37下载
- 积分:1
-
zz
说明: 图的相关操作:建立图,图的遍历,查找元素,删除元素等(Map-related steps: the establishment of map, graph traversal, find elements, delete elements, etc.)
- 2008-07-25 15:20:23下载
- 积分:1
-
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
-
1
说明: 数据结构中的顺序表,是其中的一个重要组成部分(The order of the table data structure is an important component of which)
- 2011-05-06 14:34:13下载
- 积分:1
-
8sort_method
随机函数产生10000个随机数,用快速排序、直接插入排序、冒泡排序、选择排序的排序方法排序,并统计每一种排序所花费的排序时间和交换次数。其中随机数的个数由用户定义,系统产生随机数。(Random function generates 10,000 random numbers using quick sort, insertion sort, bubble sort, select Sort sort Sort, and statistics for each sort spend the sort of time and the number of exchanges. Wherein the number of the random number defined by the user, the system generates random numbers.)
- 2013-02-27 17:27:04下载
- 积分:1