数据库学习

本程序用于数据的折半查找,是折半查找的基本算法-the procedures for the binary search data is the basic binary search algorithm

家庭理财系统.rar-family financial management system. Rar

数据结构里的动态规化法，给出两个字符串的相同部分。-Data structure of the dynamics of regulatory law, given the same part of the two strings.

别人的VC操作Access数据库都是用的GUI,让VC手生的看了迷糊,不得要领,这次我封装一个纯C++操作Access2000库的源代,主要封装了一个访问Access数据库的类,非常简单.-Someone else" s VC action Access databases are used in GUI, so that VC looked rusty" s confused, but to no avail, this time I packaged a pure C++ source operating Access2000 database generation, mainly encapsulates an Access database, access to classes, is very simple .

问题描述： 假设一个商店，它有一个货架和一个仓库，当货架上的商品数量少于一定的数目时，从仓库运一定数量的商品摆到货架上，当仓库里的商品的数量少于一定的数目时，购买商品把仓库填满，商品的出售要按照商品的生产日期来，快要过期的商品要先出售。 解决问题的方法： 用了两个栈和 一个队列，把队列当作仓库，用一个栈作为货架，把另一个栈当作临时的存储箱。当要往货架上添商品时，先把作为货架的栈中的元素全都压到作为存储箱的栈中，再把仓库中的元素压到存储箱中，然后再把存储箱中的所有元素都压到货架上，这样，就能保证快要过期的商品先被出售。-Problem description : Suppose a shop, which has a shelf and a warehouse, when the merchandise on the shelves less than a certain quantity of the number, a certain number from the warehouses of goods on the shelves, when the warehouse volume of goods is less than certain number, purchase goods warehouse filled, the goods according to the sale of commodity production to date, is about to expire first sale of goods. The solution : a two stack and a queue, queue as a warehouse, used as a stack shelves, and another stack as a temporary storage bins. When to go to the shelves Tim commodity, first as a stack shelves of all elements of the pressure storage tank as the stack, then the warehouse down to the storage element box, and then s

IWEOQ FJ VNXCJOIAEAFAG DFGADFXAE

《学籍管理系统》 “c# WinForm 数据库操作的简单范例 （SQL Server 2000）”-"expulsion management systems," "c# WinForm operation of the database simple paradigm (SQL Server 2000)"

从数组中 任取一个元素 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)

数据库应用课件，关于VFP-Database Application Software for VFP

Tianjin University Online Judge 的80多道题目 . -Tianjin University Online Judge