是一个很好的c++家族管理系统

E-store CMU SSD7 EXE4答案. 实现要求全部功能 绝对满分-E-store CMU SSD7 EXE4 answer. All the functional requirements to achieve absolute perfect score

题目：设有一航班售票系统，要求完成以下功能： 1）假设该民航有若干航班，要求实现增加航班和取消某个航班的功能。 2）查询：根据用户提出的终到站查询航班号、售票情况等航班信息；也可根据航班号，列出该航班已订票的乘客名单。 3）订票：根据航班号为客户订票，如该航班有余票，则为客户订票；如该航班已满员，则显示相应信息。 4）退票：按乘客要求退出已预定的机票。 -Topic: First flight with the ticketing system, required to complete the following functions: 1) It is assumed that the Civil Aviation have a number of flights, calls for increased flights and cancellation of a flight functions. 2) query: Based on user queries raised by the end of the arrival flight number, booking flight information, etc. also available under the flight number, listed in the flight

用C++写的矩阵鞍点求法-C wrote saddle point Matrix Method

按层序方式（自上而下，每层自左而右）遍历二叉树,二叉树以二叉链表作为存储-sequence by means (from top to bottom, each of which left from right) traverse binary tree, the binary tree with two forks Chain storage

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

MatrixStatic一个不错的管理系统源码-MatrixStatic a good source management system

编程求两个一元多项式的乘积。 输入 　　输入数据为两行，分别表示两个一元多项式。每个一元多项式以指数递增的顺序输入多项式各项的系数（整数）、指数（整数）。 　　例如：1+2x+x2表示为：,,, 输出 　　以指数递增的顺序输出乘积： ,,, 　　零多项式的输出格式为：,-Programming seeking the product of two one-polynomial. Enter the input data for the two lines represent two unary polynomial. One dollar for each polynomial order of the exponential increase of the input polynomial coefficients (integer), index (integer). For example: 1+2 x+ x2 expressed as: " 1,0" , " 2,1" , " 1,2" , the output of the order of the exponential increase output of the product: " coefficient, index" , " coefficient, index" , " coefficient, the index " , zero polynomial output format is:" 0,0 " ,

根据产品特性与需求，设置产品的条码格式，控制产品是否与工单信息相符，如不符合，则扫描FAIL,弹出提示；并按照单箱容量设置，提示满箱跟换箱号等信息提示，避免产品的短装，多装，错装现象，改善工厂产品的包装品质，将产品数据存与ACCESS数据库中，便于查询、修改等功能拓展。

学习数据结构写的排序代码，有冒泡排序、直接插入、希尔排序、简单选择排序、快速排序、堆排序-study data structure was sort of code, Bubble Sort directly inserted, Hill, in order of simple choice, in order of Quick Sort, Heap Sort

算法设计与分析中的贪心法源程序，用VC编写，应用贪心设计策略来解决操作系统中单机、无资源约束且每个作业可在等量时间内完成的作业调度问题-algorithm design and analysis of the greedy algorithm source, VC preparation, application greedy design strategies to solve the stand-alone operating system, without resource constraints which each job can be in the same amount of time to complete the job-scheduling problem