-
binarytree
二叉树的操作，涉及到三种顺序的遍历，树的凹入表示法，转化为一维数组储存，节点的计数，以及中序线索化。(Binary operation, involving three kinds of the order of traversal, tree concave representation into a one-dimensional array of storage, the node count, as well as in the threaded sequence.)
- 2011-05-24 20:31:13下载
- 积分：1
-
eitTableParse
该程序分析eit表的数据结构，病输出相应内容信息(parse eit table and output content info)
- 2016-05-22 17:52:42下载
- 积分：1
-
list-and-array
数组的定义与使用，数组的运算，字符串的输入与输出，冒泡排序(list and array)
- 2013-10-17 11:32:30下载
- 积分：1
-
ch555555
C数据结构常用算法程序集５，描述数据结构算法。(C data structures commonly used algorithm suite 5, describe data structure algorithms.)
- 2005-05-09 16:17:59下载
- 积分：1
-
the-dynamic-planning
本文讨论了动态规划这一思想的核心内容和其基本特点，探讨了动态规划思想的适用范围，动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts.
)
- 2011-12-15 16:49:05下载
- 积分：1
-
9
说明： 任意给定输入的一个小写英文字符串a1a2a3…an-1an (n≥5)
输出：字符串Ana1An-1a2An-2a3…A2an-1A1an,其中Ai为ai的大写形式
例如，输入aybdx，则递归程序输出XaDyBbYdAx
(Any given input of a lowercase string a1a2a3 ... an-1an (n ≥ 5) Output: the string Ana1An-1a2An-2a3 A2an-1A1an, which Ai ai uppercase for example, input aybdx recursive program output XaDyBbYdAx)
- 2012-05-30 10:59:39下载
- 积分：1
-
order
通过冒泡排序法和选择排序法实现对若干数字的排序。(To achieve the order of several numbers)
- 2014-06-08 18:35:10下载
- 积分：1
-
adms
阿当姆斯显式和隐式求解方法，用四阶龙格库塔作为起始，然后运用四阶阿当姆斯算法求解初值问题。主要程序包含在test2.cpp中，方法简单易懂。编译环境VC2010(Adam James explicit and implicit method for solving fourth-order Runge-Kutta as a start, then use the fourth-order A Williams algorithm for solving initial value problem. The main program contains in test2.cpp method is simple and easy to understand. Compile environment VC2010)
- 2012-06-09 11:27:18下载
- 积分：1
-
11组表达式求值
设计一个表达式求值的程序。该程序必须可以接受包含（，），+，-，*，/的中缀表达式，并求出结果。如果表达式正确，则输出表达式的结果；如果表达式非法，则不输出或输出其他字符。(Design an expression evaluation procedures. The program must accept (,), including +, -, *, / the infix expression, and the results obtained. If the expression is correct, the output of the expression is output; if the expression is illegal, no other characters are output or exported.)
- 2017-06-14 15:06:29下载
- 积分：1
-
graph-DFS
邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)
- 2013-10-27 20:16:41下载
- 积分：1
