-
huisuo
实现回溯算法,能解决八皇后问题等~~算法结果优化,时间复杂度较小(Implement backtracking algorithms can solve the eight queens problem, etc. ~ ~)
- 2011-12-14 11:59:39下载
- 积分:1
-
abc
数据结构的稀疏矩阵的几部分操作,广工的课程设计(Sparse matrix operations)
- 2013-12-03 15:57:53下载
- 积分:1
-
PX
说明: 一个用VS2008编写的冒泡排序算法演示程序,数组都是随机生成的。(Bubble Sort)
- 2014-06-18 20:06:13下载
- 积分:1
-
5100309203_5_8
二叉树类的前序,后序,层次遍历,其以链表方式存储(Binary tree class pre-order, post-order, hierarchy traversal, the linked list storage)
- 2012-12-16 14:16:41下载
- 积分:1
-
NoGo
计算机博弈大赛不围棋的代码 个人所写,可以用来参考( U8BA1 u7B97 u673A u535A u5F08 u5927 u8D5B u4E0D u56F4 u68CB u7684 u4EE3 u7801 u4E2A u4EBA u6240 u5199 uFF0C u53EF u4EE5 u7528 u6765 u53C2 u8003)
- 2021-04-04 19:39:04下载
- 积分:1
-
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
-
xuanzexingjiegou
选择型结构c语言编程 (Choose the type of structure of C language programming)
- 2013-09-24 22:11:37下载
- 积分:1
-
MyGPS
1>实现可以随意浏览任一景点的介绍。(功能一)
2>可以给出任意两个景点的最短距离及其路线。(功能二)
3>可以查看任一景点热度,并可以对对所有景点热度(访问次数)进行排序。(功能三)
4>每个景点相关内容从文件读取,实现对文件操作的练习。
(1> implementations can feel free to browse introduce 任一景 points. (Function a)
2> You can give the shortest distance and route between any two attractions. (Function b)
3> You can view Renyi Jing point heat, and heat can all attractions (visits) to be sorted. (Function c)
4> each spot related content file reading, to achieve the file operations exercises.)
- 2015-11-12 22:16:01下载
- 积分:1
-
1013_digital_root
数字根算法,用最简单的代码计算数字根。如果把一个大数的各位数字相加得到一个和,再把这个和的各位数字相加又得一个和,再继续作数字和,直到最后的数字和是个位数为止,这最后的数称为最初那个数的“数字根”。(Digital root algorithm, with the most simple code to calculate the digital root. If you figure in a large numbers is the sum of a, then this and you figure the sum is again a, and then continue for digital and until the final figure and the single digits, the last number called initially that the number of "digital root".)
- 2012-04-27 10:07:18下载
- 积分:1
-
Polynomial
Polynomial基于数据结构的思想,文件比较小,可以直接运行(Polynomial based on the idea of data structures, file is relatively small and can be run directly)
- 2013-12-11 11:05:18下载
- 积分:1