C/C 开发的运行于linux/unix下的程序转换到现有数据库下，基于RAD开发的程序。...

发货查询系统作业，delphi 写的,演示 数据库德操作和 打印输出-this is a test for delphi and access

利用随机函数产生30000个随机整数，利用插入排序、起泡排序、选择排序、快速排序、堆排序、归并排序等排序方法进行排序，并统计每一种排序上机所花费的时间-Using random functions to generate 30,000 random integers, the use of insertion sort, bubbling sort, select sort, quick sort, heap sort, merge sort and other sorting methods to sort and sort each type of statistics on the time machine

包含有各种各样的数字信号处理经典算法源代码,很有用的.-includes a wide variety of classical digital signal processing algorithm source code, very useful.

我们数据结构课上的一些作业 包括约瑟夫环和哈夫曼树之类的几个程序-Our data structure class operations, including some of Joseph Huffman tree rings and several procedures, such as

JDBC 数据库嵌入java内，通过java变成实现数据库的嵌入及调用，可向数据库中添加记录-JDBC

一个很好的VC源代码，值得借鉴-a good VC source code, worth learning

二叉树算法,如何构造二叉树以及对二叉树的操作-BinaryTree

实现一个B*Tree的添加和查找，输入数据为一组字典文件-achieve a B* Tree Search and the addition, the input data for a group of documents dictionary

求解约瑟夫问题。设有n个人围成一个圆圈坐下，对所有围从的人从某个位置开始编号为1,2,3，……，n,从编号为1的人开始报数1，报数依交进行，报数n的人即出列，下一个人从1开始报数，再报数m的人便是第二个出列的人如此重复下去，直到最后一个人出列为止，于是便得到一个出列的顺序，这称之为约瑟夫(Josephu)问题。-solving problems. N individuals have formed a circle to sit down, all right Wai from the start from a position of No. 1, 2, 3, ..., n, for a number of people reported a few, according to several newspaper pay, the newspaper n ie the out, the next person was from the beginning a few , and reported m is the second out of this series continue to repeat until the final out in a series, then get a series out of order, which called Joseph (Josephu) problem.

We discussed two versions of the 3-sum problem: A "naive" implementation (O(N^3)) and a "sophisticated" implementation (O(N^2 lg N)). Implement these algorithms.  Your implementation should be able to read data in from regular data/text file with each entry on a separate line.