商店信息管理系统源代码2600多行 有图形界面 仅供学习参考...

C#与.net4.0数据库开发书源程序第一章

This program can do Parking management

数据结构底层经典算法――时间陷阱，请大家参考-underlying data structure classical algorithm-- time trap, please refer to

数据结构课程的源代码，源码都可以运行。是初学者的好帮手。-Data structure course source code, source code can be run. Is a good helper for beginners.

实现m阶B_树 （2）将线性表中的键值插入到B_树中（即建立索引）； （3）当删除和插入数据到线性表时，同时维护其索引B_树。 （4）可根据所给键值范围，输出该范围的所有键值-achieve m bands Containing tree (2) linear scale for the keys inserted into Containing tree (index); (3) When the deletion and insertion of data to the linear scale, while preserving its index Containing tree. (4) According to the pair, the scope of the output of all keys

一个用C++实现的B+tree程序源代码-b+tree implemented with c++

1.本程序由本人采用vc++ 6.0编写，包括了排序平衡二叉树的整套算法（包括插入、删除、查找以及其测试算法）。 2.运行myavl_vc.exe输入树的初始结点个数，确定后本程序将在内存中生成一棵相应结点数的二叉树，在此基础上你可以进行各种操作（插入、删除、查找以及测试其平衡性、排序性等） 3.每一个结点信息包括"商品编码"、"商品名称",且以"商品编码"作为关键字 4.初始生成的树的结点的商品编码为从1按顺序递增，商品名称为"生成的商品"加上商品编码 5.程序中的随机插入与随机删除是为了更好的测试程序的正确性和可靠性 6.随机插入（删除）时，程序将不断向（从）树中随机插入（删除）结点，每次随机插入（删除）都会进行平衡性与排序性的检查，如果树已经失去了有序性或平衡性，则会弹出树已失去了有序性或平衡性的提示并停止插入（删除）操作，当然你可以随时中断随机操作-1. The procedure I used vc 6.0 preparation, including the sequencing of the entire balanced binary tree algorithm (including insert, delete, search and test algorithm). 2. Running myavl_vc.exe importation of the initial tree node number, the procedures established in the memory of the formation of a corresponding nodes of a binary tree, and on this basis you can conduct various operations (insert, delete, search and testing their balance, sorting etc.) 3. each node information including "Product Codes," "trade names," and the "commodity codes" as the keyword 4. initial produ

数据结构》的全部代码实现（C语言）,配合《数据结构》算法实现及解析使用。-data structure, "the realization of all the code (C language), with a" data structure "and analytic algorithm used.

vector control: an example in vector control of induction motor

一些c语言常用的算发，最近有程序设计比赛，也是比算法的，可以作为参考学习！-some of the language used fat count, the recent design competition procedures, as well as the algorithm can be used as reference learning!