各种常用的排序算法的演示程序， 以顺序表作为存储结构～～～～ 欢迎大家指正...

同一个数据库开发的系统，里面有源代码和发布版本-with a database development systems, which Active code and releases

这是初学者的宝典,以以往的编程白例是不同的,有较大的区别,里面有100多个编程实例-This is a beginner"s book for the past programming white cases are different, the difference is larger, there are more than 100 examples of programming

基于C语言的各种典型排序算法：插入排序，气泡排序，希尔排序，快速排序，选择排序。可以用VC直接编译运行。-Based on the C language provides a variety of sorting algorithms: insertion sort, bubble sort, Shell sort, quick sort, selection sort. VC can be directly translated to run.

实用数据结构教程,让你学习数据结构不用愁,呵呵!希望这对你有用,能帮上一点忙!-Practical Guide data structure, so you learn not worry about data structures, Oh! Hope this useful to you, we can help!

能够连接各种数据库的API-to connect to various databases API

非常非常好的消息来源。访问学习数据库。有详细的解释。我们希望能帮上忙

本文介绍了sybase中如何利用sql，-This paper describes how the sybase use sql.

经过改进的C语言位操作功能-improved C-language feature

又一个c++委托（函数对象）模板类的实现-Another c++ Commissioned (function object) template class realize

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time