数据结构中经典的约瑟夫环问题的解法。

C#与.net4.0数据库开发书源程序第一章

ArkoMaster端系统模块设计文档 系统管理软件自主开发软件。 系统管理软件A实现最终目标：是可以自由横跨桌面（Desktop）、Client/Server、大型主机的不同层次的管理，管理的对象包括应用程序（Applications），数据库(Database)，网络(LAN, WAN)，系统平台(System Platform)和互连网Internet/Intranet等五个方面。-End system ArkoMaster modular design their own document management software system to develop software. A system management software to achieve the ultimate goal: It is free across the desktop (Desktop), Client/Server, mainframe different levels of management, including management of applications (Applications), database (Database), network (LAN, WAN ), system platforms (System Platform) and the Internet Internet/Intranet and other five areas.

VB写的存在定单管理系统-VB was the existence of orders Management System

FP树算法源代码 FP树算法源代码-tree FP algorithm source code tree FP algorithm source code tree algorithm source code

单源最短路径算法的C语言实现，刚学算法时写的，多多指教

遍历邻接表以及执行邻接矩阵布尔调整是数据结构里图的经典算法。- Traverse the adjacent table and adjust the implementation of Boolean adjacency matrix data structure is a classic graph algorithm.

本文详细论述了网上考试系统的设计与实现，该系统基本实现了需求分析中的功能要求，其中考生信息主要由数据库直接输入，考生成功登录后进入考生界面，考生界面主要由考试、成绩查询，试时考生输入准考证号码、考生姓名、验证码，核对正确后进入考场，关键实现了考生在选择科目后由系统随机抽题、自动组卷后进入考试页面，考-This article discusses in detail the design of online examination system and implementation of the system to achieve a basic needs analysis of the functional requirements, in which candidates from the database information directly into the main candidates to enter the candidates after the successful login interface, the main candidates from the interface results in the examination information, test when the candidates enter the ticket number, candidate name, authentication code to enter the examination room after checking the correct key to the achievement of the candidates in the selection of subjects were randomly drawn by the system after the title, Automatic Test Paper into test page test

生产管理系统所有代码，

是一个ibats和struts的整合的实例，包括多个数据库的代码，（有oracle，MySQL等）-Ibats and struts is a example of the integration, including a number of database code, (with oracle, MySQL, etc.)

利用桶排序给数组a排序，建立的桶为b和e，其中b为含有十万个桶，e为只有一个链表的桶，然后对b和e使用插入算法排序，比较两种算法的时间，b需要40毫秒左右，e需要9到10分钟。-use barrels a ranking to the array, in order to establish the barrels of b and e, b to contain 100,000 barrels of only one e Chain barrels, and then to b e used to insert sorting algorithm, the algorithm for comparing two hours, b needs about 40 milliseconds, e needs 9 10 minutes.