图书馆系统

基于数据库的编成，程序是模块化的编写，利用摁钮实现对话框的调用。数据库是SQL-based on the composition of the database, the procedure is the preparation of modular, using pressed the button to achieve box call. The database is SQL

数据结构经典算法的实现-data structure to achieve the classical algorithm

sqlite 小型数据库底层代码的实现 学习数据库底层原理很好的教材 实例-small sqlite database realize the underlying code to learn the underlying principles of good database of examples of teaching materials

该源码实现二叉树的模拟，运行时图片已经放在压缩文件夹下。-The realization of the source tree of the simulation, run-time image compression has on the folder.

数据库源代码,用来创建一个数据库,是做一个燃气系统的.-Database source code, used to create a database, is a gas system.

八皇后问题，回溯算法的经典例子，此程序可以扩展至n皇后问题。-eight Queen"s problems, backtracking algorithms classic example of this procedure can be extended to n Queen"s problem.

一元稀疏多项式计算器[加法和乘法] 问题描述： 设计一元系数多项式计数器实现两个多项式间的加法、减法。 基本要求： （1） 输入并建立多项式 （2） 输出多项式，输出形式为整数序列：n，c1，e1，c2，e2……cn，en，其中n是多项式的项数，ci，ei分别为第i项的系数和指数。序列按指数降序排列。 （3） 多项式a和b相加，建立多项式a+b，输出相加的多项式。 （4） 多项式a和b相减，建立多项式a-b，输出相减的多项式。 用带表头结点的单链表存储多项式。 测试数据： (1) (2x+5x8-3.1x11)+(7-5x8+11x9) (2) (6x-3-x+4.4x2-1.2x9)-(-6x-3+5.4x2+7.8x15) (3) (x+x2+x3)+0 (4) (x+x3)-(-x-x-3)-one yuan sparse polynomial calculator [Addition and multiplication] Problem description : Design one yuan polynomial coefficient counter achieve the two polynomials addition, subtraction. Basic requirements : (a) input and the establishment of polynomial (2) output polynomial, the output form of integer sequence : n, c1, e1, c2, e2 ... cn, en, where n is the polynomial Number, ci, ei for the first item i the coefficients and indexes. By sequencing index in descending order. (3) a and b polynomial addition, the establishment of a polynomial b, the combined output polynomial. (4) a and b polynomial subtraction, the establishment of a polyno

饭店住房管理服务系统(C#.NET)-hotel housing management system (C#.NET)

这个是数据结构经典实现算法，是一些很不错的算法-shu ju jie gou jing dian suan fa shi xian

一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution