用VC++实现数据结构中：在指定的位置上，线性表的插入

代码注重B树插入、删除的算法逻辑，适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作-focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation

数据结构中栈的经典算法――第二类背包问题，已经通过测试！-The stack data structure in the classic method- II knapsack problem, has passed the test!

有关java的一个简单树，显示树结构，程序很简单。-the java a simple tree, the tree structure, procedure is very simple.

这是一个文档管理系统，有delphi开发的，有很多功能！是我的课程设计！-This is a document management system, developed by Delphi, has a lot of functions. I was the curriculum design!

次代码是实现平衡二叉树的数据结构算法。参考的是严蔚敏c和c++数据结构书上的思想。经过调试可以连续实现删除、插入、查找算法-Sub-code is to achieve a balanced binary tree data structure algorithms. Reference is Yan Wei-Min c and c++ data structure book ideas. Debugging can be achieved through a continuous delete, insert, search algorithm

JMessage Board System-JMessage Board System...

本人收集的一些数据结构经典算法实现，感觉还不错-shu ju jie gou jing dian suan fa shi xian

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)

University Database Management System using Microsoft Access.