-
fast_sort
/*快速排序：以待排序元素中的第一个元素作为基准将带排序的元素分为三组
*大于基准元素为一组置于基准值的右边，小于基准值的元素为一组置于基准值的左边，
*基准值为一组，这样就找到了基准元素的位置就确定了
*如此递归调用。直到每一组的low==high，即实现了排序的要求。
*/
(/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)
- 2012-10-26 21:42:43下载
- 积分：1
-
suanfa
匈牙利算法以及指派问题介绍，kM算法和匈牙利算法的程序代码(Hungarian algorithm and the assignment problem introduced, kM algorithm and the Hungarian algorithm code)
- 2011-09-10 09:42:39下载
- 积分：1
-
expression
利用栈完成算术表达式求值：从键盘或文件中输入算术表达式，计算其结果并显示。要求处理过程为：（1）转换为后缀表达式并输出；（2）对后缀表达式求值并输出。
输入的表达式中可以有整数、实数、括号，运算符包括+、-、*、/、#（代表单目负）。可以多次输入不同的表达式进行计算，直到用户选择“退出”。栈的基本操作可以自己实现，也可以使用系统提供的STL实现。
(Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)
- 2011-10-30 14:14:01下载
- 积分：1
-
fibonaqi
说明： 斐波那契 式子计算，属于算法类的
用于VC6.0++(Fibonacci calculation formulas, algorithms are used to VC6.0++ class)
- 2011-04-07 09:10:16下载
- 积分：1
-
exchange
这是一个二叉树左右子树交换的简单程序，希望对大家有用！(This is a binary tree so the simple sub-tree exchange procedures in the hope for all of us!)
- 2009-10-16 21:02:19下载
- 积分：1
-
5100309373_2_9
数据结构习题答案，线性链表的实现与适用，数据结构：思想与实现2-9(Data structure exercises answer, linear linked list implementations with applicable data structure: Ideas and Implementation 2-9)
- 2012-11-23 11:12:48下载
- 积分：1
-
tree
二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
- 2013-07-09 13:39:31下载
- 积分：1
-
PolynomialCoeff
NTL应用——大数系数多项式乘法的计算。从文件读如参数，计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )
- 2021-04-11 09:58:58下载
- 积分：1
-
baiji
百鸡算法是一种简单的逻辑算法，通过不同的鸡不同的价钱，得出大鸡小鸡的个数(Typical code for white chicken algorithm)
- 2012-06-02 16:31:30下载
- 积分：1
-
abc
数据结构的稀疏矩阵的几部分操作，广工的课程设计(Sparse matrix operations)
- 2013-12-03 15:57:53下载
- 积分：1
