数据库管理的例子

该程序用Java实现了算法中的动态规划问题_漂亮打印-the program using Java to achieve a dynamic algorithm planning _ pretty Print

求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least.

1．定义二叉树的链式数据结构。 2．编写函数，创建下图所示的二叉树。 3．编写函数输出二叉树的先序、中序、后序遍历。-1. The definition of binary tree data structure chain. 2. Write a function, create a binary tree as shown in figure below. 3. Write function, the output of the first binary sequence, in order, postorder traversal.

中缀表达式转换为后缀表达式并求值 使用switch语句-Infix expression into a suffix for the value of expression and the use of switch statement

选择AL2格式文件，修改代码可以插入txt文件等等，解析文件赋值实体，格式固定，转而插入ORACLE数据库记录

快速排序的非递归算法,具有高效的特点，快速排序 -the nonrecursive code of quicksort

关于数据库学习的 关于数据库学习的-shujk

气泡排序，一个简单的排序10个数字，按从大到小排列-Bubble sort to sort a simple 10 figures, according to smallest order

VB编写的简单打印控件-prepared by the simple VB Control Print

二叉树有三种遍历方法，引用树的概念实现遍历-There are three methods of tree traversal, invoke the concept of tree traversal realize