-
abc
数据结构的稀疏矩阵的几部分操作，广工的课程设计(Sparse matrix operations)
- 2013-12-03 15:57:53下载
- 积分：1
-
Nqueen
n皇后问题构造法实现，比起启发式修补运行时间较长。(n Queen realize the issue of construction method, compared to a longer run-time heuristic repair.)
- 2008-05-16 12:45:32下载
- 积分：1
-
paixu
实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)
- 2012-05-21 22:13:12下载
- 积分：1
-
tree
二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
- 2013-07-09 13:39:31下载
- 积分：1
-
Is_BST
This is a C++ code. It finds out if the tree is a binary search tree (BST)or not, where the BST is one of data structures types.
- 2012-02-02 05:45:59下载
- 积分：1
-
bstree_frame
利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)
- 2013-08-10 16:43:50下载
- 积分：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
-
suanfa
自己编写的floyd 最短距离求解程序。实用简单。gcc
(Floyd shortest distance to write your own solver. Practical and simple. gcc)
- 2012-09-02 14:59:02下载
- 积分：1
-
Dijkstra
迪特斯特拉算法，课程设计的作品，主要计算站点距离的吧，可以看看(Dieter Stella algorithm, distance course design work, the main computing sites can look)
- 2013-04-11 10:26:15下载
- 积分：1
-
mataqipan
马踏棋盘的贪心算法，8*8棋盘，基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)
- 2006-05-30 20:05:17下载
- 积分：1
