输入稀疏矩阵中非零的元素，然后建立整个矩阵，实现这两个矩阵相加、相减和相乘运算。...

回溯法 解决男女匹配问题 八男八女匹配-Backtracking address gender matching eight men and eight women match

VFP指南示例，本程序从初学者的角度出发，涉及建立数据库、修改基本的加法操作、如何设计菜单（包括快捷菜单）、工具和类应用程序；还有应用程序，如SQL语句、语句标号设计和动画制作等内容很简单；直到一个完整的编译过程最终成功，包括VFP程序设计的大部分内容

2-3树的数据结构以及演示程序-2-3 tree data structure and Demonstration Program

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

解决N皇后问题的源码及可运行程序，分析各种情况，并输出，直观，有效！-Solve the N Queens problem can be the source and run the program, analyze, and output, intuitive, and effective!

一个简单还原二叉树并在屏幕输出树形的小程序，帮同学做的数据结构作业，估计对初学者会有些帮助-Restore a simple binary tree and tree on the screen output of the applet to help students to do homework data structure, it is estimated that it might be useful for beginners

一 开发环境 OS: Windows 2000 Server + SP2 IDE: Visual Studio 6.0 + SP5 DataBase: SQL 2000 Server + SP2 在运行程序之前，请将所附的数据库文件dms.mdb添加为数据源，并命名为DMS-A development environment OS: Windows 2000 Server+ SP2 IDE: Visual Studio 6.0+ SP5 DataBase: SQL 2000 Server+ SP2 before running the program, please attached the database file for the data source to add dms.mdb named DMS

软件工程 卡耐基 数据库 ssd7 ex1-ssd ex1

Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM). -Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).

俄国人写的内存数据库的delphi封装-Russian people write memory database delphi Packaging