-
SelectSort
选择排序的实现，是一种基本的排序方法，但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)
- 2012-09-27 22:38:22下载
- 积分：1
-
BigNumeberOperator
这是高精度大数运算的源码,对于大于64位的整形数字的四则运算，是万能的啊……(This is the code of big number s operator.)
- 2011-08-09 15:25:09下载
- 积分：1
-
ok-suit
说明： 一个实现外部排序的程序，其中gnerate.cpp为产生一个随机的文件，用于被排序。而caculate.cpp为外部排序程序。(A realization of the external sort program, which gnerate.cpp to generate a random file for be sorted. The caculate.cpp external sort program.)
- 2011-03-18 12:30:29下载
- 积分：1
-
sf_2014320164457
数据结构中的许多东西,包括头文件、例题、习题等等(Data structure many things, including the header files, examples, exercises, etc.)
- 2014-04-03 15:24:34下载
- 积分：1
-
abc
数据结构的稀疏矩阵的几部分操作，广工的课程设计(Sparse matrix operations)
- 2013-12-03 15:57:53下载
- 积分：1
-
min-dist
图中计算最短路径，必须覆盖所有的节点，效率很高(to compute the shortest path in the graph)
- 2012-01-06 00:03:33下载
- 积分：1
-
red-tree
红黑树 二叉树 性能比较分析 红黑树 二叉树(Red-black tree binary tree performance analysis,)
- 2013-03-22 16:57:32下载
- 积分：1
-
polynomial
本程序实现一元多项式合并。本程序输入方式为按项输入，每输入一个项，会先提示输入项的幂，再提示输入项的系数。(This procedure combined to achieve a dollar polynomial. This procedure according to entry input methods for the input, one for each input item, it will first prompt entry of the power, and then prompts entry of the coefficient.)
- 2009-12-16 17:29:54下载
- 积分：1
-
Online_RandMarkingAlgorithm
本程序解决的是：模拟类似计算机主、缓存的存储结构，当用户请求某个页面时，若某个页面已在缓存中，则直接从缓存中去取，不会产生失误（即未在缓存中命中），否则，就到主存中去取，代价变大。
本程序采用随机标记算法，即在在线标记算法的基础上，对于替换页面时，采用随机从未标记的缓存项中选出一项进行替换。
代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)
- 2012-09-19 13:01:47下载
- 积分：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
