-
yu992324
总结了10种排序的方式。用代码加以实现。(the ten way of Line up a preface)
- 2010-07-29 09:41:07下载
- 积分:1
-
permutations
组合数学全排列,包含有六种全排列的方法,字典序法(math of permutations)
- 2011-12-12 10:51:16下载
- 积分:1
-
youlishi
有理数的算法,包括其加减乘除,启用的是单链表的形式来表达(Rational algorithms, including addition, subtraction, enabling a single-chain form of expression)
- 2011-10-13 10:00:21下载
- 积分:1
-
B_Tree
用控制台实现了经典的数据结构B树,可以通过测试文件.txt加载已有的B树,有插入,删除,查找的功能,加深对数据结构的理解。(Using the console to achieve the classic B tree data structure, you can pass the test document. Txt already loaded B-tree, there are insert, delete, search functions, to deepen understanding of the data structure.)
- 2020-10-18 17:47:26下载
- 积分:1
-
yuesefuhuan
使用VC编写的约瑟夫环程序,简单明了,方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)
- 2009-09-08 16:45:26下载
- 积分:1
-
K_Merge
文件的多路归并排序算法, C++描述(要求待排序文件已经事先有序)(C++ implementation of K-Merge Algorithm)
- 2010-08-03 10:24:48下载
- 积分:1
-
deep-copy
该代码实现了深拷贝的问题,对于深拷贝进行了一系列的介绍,并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
- 2014-01-03 10:46:48下载
- 积分:1
-
arc
运用二叉树求代数表达式的值,将代数表达式的每个符号用二叉树结点表示,遍历图的每一结点,按结点值得不同采用不同运算方式(Solving algebraic expressions binary tree)
- 2012-06-23 19:52:38下载
- 积分:1
-
8sort_method
随机函数产生10000个随机数,用快速排序、直接插入排序、冒泡排序、选择排序的排序方法排序,并统计每一种排序所花费的排序时间和交换次数。其中随机数的个数由用户定义,系统产生随机数。(Random function generates 10,000 random numbers using quick sort, insertion sort, bubble sort, select Sort sort Sort, and statistics for each sort spend the sort of time and the number of exchanges. Wherein the number of the random number defined by the user, the system generates random numbers.)
- 2013-02-27 17:27:04下载
- 积分: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