-
maze
迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
- 2013-12-13 17:55:45下载
- 积分:1
-
permutations
组合数学全排列,包含有六种全排列的方法,字典序法(math of permutations)
- 2011-12-12 10:51:16下载
- 积分:1
-
dd2
自己用c语言写的一个模块化多电平最近电平调制排序的c程序,希望对大家有帮助(Own use c language written in a modular multi-level modulation level recently sort of c program, we hope to help)
- 2014-05-21 20:19:49下载
- 积分: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
-
maze
c语言完成的数据结构几个小算法游戏包括迷宫求解等(C language of complete data structure several small algorithm game includes maze solution, etc
)
- 2012-03-29 20:37:18下载
- 积分:1
-
HuffmanTree
用c++实现的haffman tree 小程序,仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)
- 2013-03-14 16:38:15下载
- 积分:1
-
LINK
建立链表的算法:
新节点链入表尾建立链表:
动态分配第一个节点变量;
用指针head 妥善保存链表第一个节点的地址值;
依次动态分配一个新节点变量;
将上一个节点的指针域指向新生成的节点;
循环3),4)步骤,直到所有节点均连入链表;
将最后一个节点的指针域赋值为0;
(Establish the list of algorithms:
The new node links footer build list:
Dynamic allocation of the first node variable
Keep the list head pointer of the first node address value
In order to dynamically allocate a new node variable
The domain of a node pointer to the new generation of nodes
Cycle 3), 4) step, until all nodes are connected to the chain
Pointer field will last node assigned to 0 )
- 2015-01-05 16:03:48下载
- 积分:1
-
order
通过冒泡排序法和选择排序法实现对若干数字的排序。(To achieve the order of several numbers)
- 2014-06-08 18:35:10下载
- 积分:1
-
Bigint
利用双向链表实现对两大整数的相加运算。
可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
- 2007-10-18 21:34:06下载
- 积分:1
-
Function-parameters
C语言插入排序算法及代码
C语言中函数参数的传递有:值传递、地址传递、引用传递这三种形式。题一为值传递,题二为地址传递,题三为引用传递。(Insertion sort algorithm and C language code
The parameter of function in C language transfer: transfer value, address, pass by reference to these three forms. Problem a value transfer, the transfer of Title address, three for reference.
)
- 2014-06-30 21:28:28下载
- 积分:1