在线升级，希望对大家有帮助,这只是一个简单的DEMO

Open source PHP POS for small to medium sized companies

c语言源代码小合集 c语言源代码小合集-c language source code for a small collection of small c-language source code collection

这是一个图书馆的管理程序，含学生登录借阅书刊查找等功能-This is a library management procedures, including students log books to search functions

列举系统中的所有字体(41KB)-list of all system font (File) lt; ENDgt;

计算机怎样解几何题 - 谈谈计算机自动推理-How to Solve geometric computer title- to talk about the computer Automated Reasoning

windows mobile Demo_StepByStep,很不错的入门资料-windows mobile Demo_StepByStep very good introductory information on

一个简单的聊天程序，功能 可以近一部完善 这是我的 作业，-A simple chat program, function can be nearly a perfect This is my work,

用c语言实现阅瑟夫环,是利用数据结构实现的-Realize the Joseph Ring with C language, and it is realized with data structure.

Description: 对整型有序关键码序列进行折半查找，待排序序列以数组存储。如果找到待查记录，返回找到的位置下标，并删除该关键码记录；如果没找到待查记录，返回0，并将待查记录插入到适当位置，即该查找属于动态查找。输出查找过程中每一轮的low，mid，high 值，以及与给定值相比较的关键码值，并输出最后找到的位置，及变化后的数组。 注意：该数组为整型，数组中关键码存储位置为r[1]~r[n]，r[0]留作它用，且关键码个数大于4. Input Format: 第一行输入数组中记录个数n 第二行输入n个有序的整型关键码，以空格隔开 接下来输入三个待查关键码，每个关键码占一行 Output format: 对于每个关键码，分别输出： 找到给定值之前的每一轮的low，mid，high及相比较的待查找序列中的关键码，以空格隔开 接下来一行输出查找到的位置 接下来一行输出变化后的待查找序列 -Description: The key codes for integers ordered sequence of binary search until the sorting sequence to an array of storage. If you find a complete set of records, returns to find the location of the next standard, and delete the key code is recorded if not find a complete set of records, returns 0, and a complete set of records inserted into the appropriate location, that is, the search was part of search. Find out the process for each one of the low, mid, high value, as well as compared to the value given the key code value and output of the last to find the locat

实现图形轮廓包围盒的描述。内容包括设置包围盒的线段，设置包围盒的最大最小点-Graphic description of contours bounding box. Content includes the provision of bounding box of the segment, set the minimum bounding box of the largest point