-
courseDesign
C语言课程设计例子,迷宫的实现,包括了需求分析,概要设计,详细设计,测试,源代码等(C language curriculum design example, the realization of the maze, including requirements analysis, preliminary design, detailed design, testing, source code, etc.)
- 2011-11-23 23:41:04下载
- 积分:1
-
luciferLanguage
这是acm里关于魔王语言的一道题,通过栈和队列的知识来解决。(this is balout luciferlanguage . i use the datastructure with stack and queue.)
- 2011-11-28 17:04:19下载
- 积分: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
-
xiaobaishu
参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写,很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
- 2013-08-29 16:09:43下载
- 积分:1
-
migongproduce
迷宫生成器,可以根据需要自己建立各类型的迷宫,而且能求解出线路(Maze maze of various types of generators, according to the needs its own, but also to solve the lines)
- 2012-02-10 15:17:36下载
- 积分: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
-
9
说明: 任意给定输入的一个小写英文字符串a1a2a3…an-1an (n≥5)
输出:字符串Ana1An-1a2An-2a3…A2an-1A1an,其中Ai为ai的大写形式
例如,输入aybdx,则递归程序输出XaDyBbYdAx
(Any given input of a lowercase string a1a2a3 ... an-1an (n ≥ 5) Output: the string Ana1An-1a2An-2a3 A2an-1A1an, which Ai ai uppercase for example, input aybdx recursive program output XaDyBbYdAx)
- 2012-05-30 10:59:39下载
- 积分:1
-
1
说明: 可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)
- 2013-11-13 21:16:53下载
- 积分:1
-
maopao_youhua
冒泡优化:
如果一个序列是int n[]={1,2,3,4,5,6,7,8,9} , 用正常的冒泡排序需要排8次才行,优化之后1次就好,也就是说序列越接近于正常序列,改进之后的冒泡排序的次数就越少,这样会给一个冒泡排序算法带了很大的效率。
思想:添加一个boolean变量用来判断冒泡是否是已经排好了顺序,如果boolean的值为false,说明是已经排好了,如果boolean的值true,说明没有排好,继续排。(If a sequence is int n [] = {, 1,2,3,4,5,6,7,8,9} need to row 8 times the job after optimization times like normal bubble sort, but alsomeans that the sequence is more close to the normal sequence, improved bubble sort, the less the number, which would give a bubble sort algorithm with a great deal of efficiency.
Idea: add a boolean variable used to determine the bubble whether it is already lined up the order, if the boolean is false, indicating already lined up, if the boolean value of true, did not line up, continue to row.)
- 2012-04-18 00:33:45下载
- 积分:1
-
ggg
mfc 连接数据库 用mfc做的管理系统,戏中包括数据库连接(mfc connect to the database)
- 2012-08-22 17:08:04下载
- 积分:1