This is a materials management system, some errors, but also please correct!

数据结构中的AVL TREE的实现-data structure of the realization of AVL TREE

[问题描述] 将N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N） [输入] 待排序记录个数，各关键字的值。 [输出] 关键字从正负分开，正数在前 [存储结构] 待排序记录顺序存储。 [算法的基本思想] 快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序， 以使所有关键字为非负数的记录排在关键字为负数的记录之前。 #include using namespace std #define MAXNUM 100//设文件的最长可能长度 void sort(int* keys, const int len)//排序 -[Problem Description] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword

用delphi实现的各种排序算法，图形界面，可实现插入排序、交换排序、选择排序、合并排序以及基数排序-used to achieve the various sequencing algorithms, graphical interface, insert can be realized, in order of ranking exchange, SELECTION SORT, the merger sort of base sequencing

unix上的TDS协议实现，实现了sybase/mssql的dblib,ctlib和ODBC-unix on the TDS protocol to achieve sybase/mssql of dblib, ctlib, and ODBC

简单介绍了一种数据结构的构建及其使用情况-introduces a simple data structure of the building and its use

网上考试的实现．用asp和access边的．毕业论文-online examination realized. Asp and with the access edge. Thesis

数据结构程序设计――哈夫曼编码，希望给同学一些帮助-Data Structure Programming- Huffman coding, the students want to give some help

一个简单适用的产品订购系统，适合初学者使用-A simple application of the product ordering system, suitable for beginners to use

关于算法优化的例子，简单的例子：灰度变换，嵌入式处理用得到，一种优化思想，方法-Algorithm optimization on the example of a simple example: gray-scale transformation, embedded processing used to be, an optimization ideas, methods,

用邻接矩阵的形式实现了求有向图的强连通分量。-Adjacency matrix with the form of a demand directed graph strongly connected component.