很好的算法，龙贝格积分算法，大家可以下载

霍夫曼编码前缀编码Huffman Coding-Huffman Codeing

车厢重排,一个c++数据结构习题-compartments rearrangement, a data structure c Exercises

ado+ACCE

pb 源码 进度条程序-progress of the process

--个定时备份Oracle数据库的PB程序--- 000 regular backup of Oracle database procedures PB

自定义数据类型的堆栈数据结构实现，早些时候学习的时候写的代码了，-Custom data types of the stack data structure to achieve the earlier study, when writing code, and

要控制我的信息系统是一个非常聪明的简单的项目。你可以学习如何添加、 更新、 删除和查询与 php mysql 语言......

实现二分法求解方程。编写并使用以下函数： double SolveRoot(double(*pf)(double x),double a,double b,int n) 这里，pf指向一个函数f，f用来定义要求解的方程f(x)=0，a和b是未知解x的上下界（即a

栈(stack)是程序设计过程中经常遇到朝气一种数据结构形式，它对于数据的存放和操作有下面这样的特点： 1) 它只有一个对数据进行存入和取出的端口； 2) 后进者先出，即最后被存入的数据将首先被取出。其形式很象一种存储硬币的小容器，每次只可以从顶端压入一个硬币，而取出也只可以从顶端进行，即后进先出。 这样的数据存储和管理形式在一些程序设计中很有用。例如，编译系统中(这是一类比较复杂的程序)，对于函数调用的处理、对于表达式计算的处理，都利用了栈这样的数据结构。- The stack (stack) is in the programming process frequently meets the vitality one kind of construction of data form under, it has such characteristic regarding data depositing and the operation: 1) it only has a logarithm according to the port which carries on stores and takes out; 2) less advanced first leaves, namely finally the data which will store first is taken out. Its form looks like one kind of memory coin very much the small container, each time only may press in a coin from the peak, but takes out also only may carry on from the peak, namely less advanced first leaves. Such data storage and the management form are very useful in some programmings. For example, in the compiling system (this is a kind of quite complex procedure), transfe

一个表达式计算器的算法,编译后运行,输出output.txt-An expression calculator algorithms, compiled to run, the output output.txt