有关java的一个简单树，显示树结构，程序很简单。

包含各种测试,查找和算法等代码,如冒泡算法,树的遍历,链表,队列,堆栈等-includes various tests, such as search and algorithm code, such as Bubble algorithm, the tree traversal, linked list, queue, stack, etc.

实现了插入排序，希尔排序， 冒泡排序，快速排序，选择排序，堆排序和归并排序，以及可以对排序的性能进行分析，较适合用作排序算法的学习-achieved insertion sort, Hill, in order Bubble Sort, quick sort, select, in order of ranking and sculpture merge sorting, and sequencing can analyze the performance and more appropriate for the learning algorithm

Visual.C.实践与提高数据库篇.pdf 大家参考下。-Visual.C. Practice and improve database articles. Pdf we refer to the following.

文件包含的内容： 常见的algorithm，使用vc6开发的 包括排序算法-document contains elements : common algorithm used in the development vc6 Sorting Algorithm

私人潜艇 Load_Faculty() Dim con 作为新 OleDbConnection Dim cmd 作为新 OleDbCommand 作为 OleDbDataReader 的 dim 博士 Dim arrImage() 作为字节 Dim myMS 作为新的 IO。MemoryStream 声明作为字符串存放连接 = String.Empty 请尝试 声明存放连接 ="选择 b.FacultyID、 b.Image、 b.Course、 a.Course" 声明存放连接 = 声明存放连接 &"从作为左的联接学院作为 b studentsrecords" 声明存放连接 = 声明存放连接 &"a.ID = b.FacultyID WHERE(a.Course = @Course) a.Course 按顺序" con = 新 Ole

人事管理，可用小型企业内部人员管理 采用Delphi编写，登录用户名密码为： admin -Personnel management, small businesses can be used internal staff to manage the preparation of the use of Delphi, the logged-on user name password is: admin

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

大整数整除，char *d返回余数，char*c返回结果 -Large integer divisible, char* d return the remainder, char* c return result

北京邮电大学计算机应用硕士论文__数据仓库体系结构设计 包括答辩稿 水平自然是高希望对你有所帮助-Beijing University of Posts and Telecommunications Computer Application master"s thesis __ data warehouse architecture design includes text reply is naturally high level of hope for your help