1

简单的汉诺塔算法，采用归约算法的思想，实例是三个盘子，三个柱子(Simple HANOR algorithm)

二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)

题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 (Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers)

说明：  一个用VS2008编写的冒泡排序算法演示程序，数组都是随机生成的。(Bubble Sort)

数据结构二叉树，及其遍历，镜像，输出等相关操作C++源码。(Binary tree data structure and its traversal, mirror, output the operation C++ source.)

说明：  动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)

拓扑排序 -打印输出计算机本科专业4年每学期的课表(Topological sort - computer printout of undergraduate curriculum of each semester for 4 years)

本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)

说明：  由C程序实现的 数学上 滑雪问题 的代码实现，供大家学习用(Ski problem code for all to learn to use)

实现冒泡，快速，希尔排序法。并计算，比较他的次数。(Achieve bubbling fast shell sort. And calculate, compare the number of times.)