用循环单链表实现队列的基本操作,用循环单链表实现队列的基本操作,详见包内“代码”文档...

MaxHeap operation like insert and delete

数据结构的课后练习-Data structure of the after-school practice

一个简单的数据库管理系统,是用delphi开发的.-a simple database management system, is to use Delphi development.

数据结构栈和队列相关练习，让你熟练掌握掌握它们的用法，迅速编程-Stack and queue data structure practice, so that you master

[问题描述] 将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

数据结构常用算法程序集1，描述数据结构算法。-data structure used an algorithm set procedures described algorithm data structure.

We discussed two versions of the 3-sum problem: A "naive" implementation (O(N^3)) and a "sophisticated" implementation (O(N^2 lg N)). Implement these algorithms.  Your implementation should be able to read data in from regular data/text file with each entry on a separate line.

query数据库的例子-example database query

基于Visual C++开发的，关于电梯工作过程的模拟的程序源代码。电梯模拟-Based on Visual C++ Developed in the course of its work on the elevator simulation program source code. Elevator Simulation

数据结构课程设计，C语言，其中包含两则，一个是单链表的基本操作，500条语句，另外一个200条，是利用堆栈进行多种运算，均有报告-Curriculum design, data structures, C language, which contains two, one is the basic operation of a single linked list, 500 statements, while a 200 is the use of the stack for a variety of operations, are being reported