sheah

详细讲解四个排序算法，帮助大家理解~不过是英文版的哦~原汁原味~呵呵~-Elaborate on four sorting algorithms to help you understand the English version but oh ~ ~ genuine

堆排序 稳定的排序 复杂度为N（logN ） 也是一种快速的排序-HEAPSORT stable sort complexity is N (logN) is a fast sorting

数据仓库建模技术详解-data warehouse technology Elaborates on Modeling

磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn

本程序实现调用开放式数据库连接 (ODBC) 函数，及调用 ODBC 函数 SQLTables 和 SQLColumns。 显示选定数据库中的所有表，以及为每一个表显示列的列表和有关每一列的信息.-the program called Open Database Connectivity (ODBC) functions, and ODBC function calls and SQLColumns SQLTables. Shows selected database of all the tables, and each table shows a list of columns and each of the information.

文件的多路归并排序算法， C++描述（要求待排序文件已经事先有序）(C++ implementation of K-Merge Algorithm)

DAO读写-literacy DAO

无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)

实现超市中排队购物用时最短，是计算机算法设计与分析中的一道题。自己写的程序，原创！(Achieve queued supermarket shopping with the shortest, is a question in the design and analysis of computer algorithms. Write their own procedures, original!)

SQL入门使用与高级使用篇。 SQL入门使用与高级使用篇。-SQL entry with the use of the use of the High chapter. SQL entry with the use of the use of the High chapter.