数据结构底层经典算法――时间陷阱，请大家参考

Oracle培训18天老师的笔记，对学习oracle数据库有非常大的帮助-Oracle training in 18 days the teacher

用VC实现的几个常用的数据结构-with VC several commonly used data structures

计算机科班学生的数据结构课的-‘表’（VC写的源程序）-computer classes to the students of the class of data structure-the "Table" (VC was made of the source)

用aspvbScript实现数据结构中的排序算法-aspvbScript use data structure of the algorithm

这是一个网络数据库回调例程,基于SocketConnection的-This is a network database callback routines, based on the SocketConnection

问题描述：设有11种不问的钱币各若干张，可用这II种钱币产生许多不同的面值。试 设计一个算法，计算给定的某个面值，能有多少种不同的产生方法。例如有1分3张，2分 3张，5分1张，则能组成7分面值的方法有：3个1分+2个2分，1个1分十3个2分，2 个1分+1个5分，1个2分+1个5分共四种。 ^编程任务：对于给定的II种不同钱币，编程计算某个给定面值能有多少种不同的产生 方法。-Problem Description: There should be 11 kinds of coins did not ask the number of beds available this II produced many different kinds of coin denominations. Try to design an algorithm to calculate a nominal value of a given that there can be many different returned. For instance, a sub-3, 2 points 3, 5 min 1, then can be composed of seven sub-par methods are: 3 1 min+2 2 points, a 1 minute 10 3 2 points, 2 1 points+1 5 points, a 2 min+1 5 minutes of four kinds. ^ Programming task: for a given II different coins, the calculation of a given program can have many different denominations is returned.

图的建立、遍历、最小生成树、最短路径 图的建立、遍历、最小生成树、最短路径-plans the establishment, traverse, the minimum spanning tree and the shortest road map for the establishment of traversal, minimum spanning tree, shortest path

汽配管理系统 用C语言设计的完整的系统

自己写的堆栈算法，C语言＋Visual C++6.0环境下-Write their own stack algorithm, C language Visual C++ 6.0 environment

遗传算法的源程序，用于多组分样品的拉曼光谱的分析的C语言原程序 -genetic algorithms