各种排序算法，包括快速排序、插入排序、选择排序、SHELL排序...

AppWizard has created this 插队买票1 application for you.   This file contains a summary of what you will find in each of the files that make up your 插队买票1 application. 插队买票1.dsp     This file (the project file) contains information at the project level and     is used to build a single project or subproject. Other users can share the     project (.dsp) file, but they should export the makefiles locally. 插队买票1.cpp

1.本程序用以实现对线性链表的维护、插入、删除、输出等功能，在该实验设计中是以某商家电部门的库存为模型，实现了对该商品库存的更新，如商品的进货、提货的业务，以入对商品库存的修改、查询、删除等等。-1. The procedures used to achieve linear list maintenance, insert, delete, output functions, in the experimental design is a commercial appliance sector inventory model of this merchandise inventory updates, such as the purchase of goods and delivery of services with a pair of goods into inventory changes inquiries, delete, etc..

1.通过鼠标拖拽和弹出对话框完成实体、属性、联系的绘制以及各参数设定 2.对绘制的实体、属性、联系提供合法性检查 3.对绘制的图形进行拖动、重设大小、删除 4.通过属性对话框对实体、属性、联系的各种参数进行重新设置 5.数据的串行化 6.将绘制完成的E-R图转换成数据库脚本-1. Through mouse drag and drop and pop-up dialog box to complete entities, attributes, links, as well as drawing parameter setting 2. Drawing entities, attributes, links provided to check the legality of 3. The graphics on the drawing drag, reset size, delete 4. through the Properties dialog box on the entities, attributes, linked to various parameters re-set 5. serialization of data 6. will be drawn to complete the ER diagram into a database script

本代码演示了使用MS SQL和delphi进行简单数据库开发，一个简单的学生成绩系统，附近中有数据库创建的文本-This code demonstrates the use of MS SQL, and delphi simple database development, a simple student achievement system, there is a database created in the vicinity of the text

一个基于foxbase小程序，现在用的已经不多了，但是希望还有用-a small program using the already limited, but also with hope

vb6 database programing sample code

Java写的部分数据结构源码-Written in Java source code part of the data structure

设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main function of the input data for testing

0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.

展示您的产品或宣传你的个人商业页。此代码帮助您执行此脚本来提高你的业务的页面。