maze1

某公司收到若干报价，然后报价由低到高进行排序。设最低报价为F,最高报价为G。n=0.2*(G-F) 设A，B，C，D，E五个等距区间并取： A=[F,F+n） B=[F+n,F+2n) C=[F+2n,F+3n) D=[F+3n,F+4n) E=[F+4n,G) 所有的报价都按各自的大小，分别列入上面五个区间。各自区间内的最小报价为该区间的代表报价。如果某区间内没有报价 则以小于该区间的且与该区间相邻的区间内的最高报价代表该区间报价，如果该区间与与之相邻的较小区间内都没有报价则该区间不参加最后计算。取各区间的代表值， 求出其平均值 做为评标基准报价 (A company received a number of quotations, and quotations from low to high order. Minimum price for the F, the highest offer for the G. n = 0.2* (GF) Let A, B, C, D, E, and five equidistant intervals obtained: A = [F, F+ n) B = [F+ n, F+2 n) C = [F+ 2n, F+3 n) D = [F+3 n, F+4 n) E = [F+4 n, G) All quotes are by their size, five were included in the above range. The minimum offer their own range representative of the range quoted. If a range does not offer less than the range of places and range of adjacent intervals with the highest offer within the offer on behalf of the interval, if the interval and the adjacent smaller range do not offer the range not to participate the final calculation. Take the representative value of each interval, calculate the average price as a benchmark evaluation)

校园导航系统 1） 校园景点介：绍介相关景点的有关详细信息。 2） 最佳路线查询：查询校园中任意两点之间所有路线，并提供两点间最短的简单路径。 3） 关节点查询：提供校园图的关节点查询。 4） 多景点最佳路线查询：提供多个景点的最佳线路查询，即求途径这个景点的最佳路径。 (Campus Navigation System 1) campus attractions Introduction: Shao Jie-related attractions for more information. 2) The best route query: Query on campus all the routes between any two points, and provides a simple shortest path between two points. 3) joint points: the key points to provide the campus map queries. 4) The best route queries more attractions: multiple sites to provide the best route queries, that is seeking ways to this spot the best path.)

图书馆管理系统被实施的 java 平台有利于机构和图书馆数据通过计算机系统进行管理。在本场景中图书馆在手册中维护信息记录，他没有有效的方法。随着软件应用程序使用在我们日常的生活发展越来越多像这样的应用程序将简单任务，节省大量时间。使用此系统整个库数据在数据库中维护，只是所使用的软件应用程序用户可以找出的书籍图书馆与出动搜寻整个媒体库中的可用列表。同样这个应用程序还保持用户采取了书籍和返回日期的详细信息和用户详细信息。

人事管理系统，软件工程课程设计，TC3下调试成功，采用链表结构，实现增加删除查询等功能，调用汉字库实现汉字输出-Personnel Management System, software engineering curriculum design, debug TC3 successfully used Chain structure, the added features such as deleted inquiries, call for Chinese exports Store

数据结构常用算法设计 用C++实现二叉排序树与平衡二叉树-algorithm commonly used data structures designed to achieve two C-tree fork and balanced binary tree

此项目帮助您管理您的数据与交易基地使用 ConnectionString、 OleDb 或 Odbc 连接。

一个车辆管理系统 一个车辆管理系统-A vehicle management system for a vehicle management system

计算某日在本年的第几天 已经用C语言实现过了 可以运行(Calculation of a certain day this year has been implemented in C too can run)

说明：  一些基本的数据结构问题，用C语言实现，我们学校的上机作业，大家可以参考一下 包括1、Josephu问题 2、一元多项式加法 3、三元组表示的稀疏矩阵的一些操作 4、n阶“魔方”的解法 5、Hanoi塔 6、中缀转后缀 7、二叉排序树 8、快速排序 9、谢尔排序(Some basic data structure problems, implemented in C language, our school homework on the computer, you can refer to it. Including 1, Josephu Problem 2, Polynomial Addition 3, Some Operations of Sparse Matrix Represented by Triple 4. Solution of Magic Cube of order n 5, Hanoi Tower 6, suffix-to-suffix 7, binary sorting tree 8, fast sorting 9, Shell sorting)

数据结构：顺序表-data structure : the order form