快速排序 基本思想：通过一趟排序，将待排序记录分割成独立的两部分，其中一部分记录的关键字均比另一部分记录的关键字小，则可分别对这两部分记录进行排序，以达到整...

用c写的数据结构问题-Construction of data question writes which with c

用链表实现栈的操作.该程序有栈的进栈和出栈操作.很简单.这是本人第一次上传程序源代码,如有什么不足之处还望各位多多海涵.-used to achieve stack operation. The program is the stack into the stack and stack up operation. Very simple. This is the first time I uploaded the source code, if there are any deficiencies Agency also look to a lot Haihan.

这是我的功课，与我的朋友。此示例数据库从 dvd 出租店。有 6 个实体，有一个关系 N N，N-1，执行查询，子查询，函数、 包，过程中，光标和触发器。

给定一个n位正整数a，去掉其中任意k

本程序使用Visual C++6.0编写，使用了MFC，数据库用的是SQL Server，要正常运行本程序，请安装该数据库，并参看压缩文件中的DBConfig.ini文件。本程序如果和已经上传的NetControlManager已经完全可以满足用户对局域网控制的需求，特色功能包括：登陆认证、局域网内特定IP上网限制等-This procedure using Visual C++ 6.0 preparation, the use of the MFC, the database used is SQL Server, to the normal operation of this program, please install the database and see the compressed file in the document DBConfig.ini. This procedure has been uploaded If NetControlManager has been fully able to meet user demand for LAN control, features include: login authentication, LAN specific IP access restrictions

VB+ACCESS2000编写的VCD出租管理系统-VB ACCESS2000 prepared by the VCD rental management system

删除ORACLE数据库记录，条件选择，多表选择，删除结果显示，显示删除表数据的条码，对应每一个表多少记录，数据库多表可选择删除，结果多条显示

Co oporate banking.is 不错的银行体系已写下 c + +.developed 由一组称为 ASN 在加纳......在 2013年 7 月中午，已投放市场

八 方块移动游戏要求从一个含8个数字（用1-8表示）的方块以及一个空格方块（用0表示）的3x3矩阵的起始状态开始，不断移动该空格方块以使其和相邻的方 块互换，直至达到所定义的目标状态。空格方块在中间位置时有上、下、左、右4个方向可移动，在四个角落上有2个方向可移动，在其他位置上有3个方向可移 动。例如，假设一个3x3矩阵的初始状态为： 8 0 3 2 1 4 7 6 5 目标状态为： 1 2 3 8 0 4 7 6 5-Eight-box requirements of mobile games from one containing eight numbers (1-8 with express) the box, as well as a space box (with 0) of the 3x3 matrix of the initial start, and constantly move the box to make space its adjacent box and swap until they reach their defined target state. Spaces in the middle position box has the upper and lower, left and right direction of four removable, in the four corners there are two directions can be mobile, in other locations has three movable direction. For example, suppose a 3x3 matrix of the initial state as follows: 803,214,765 target state as follows: 123,804,765

用迪杰斯特拉算法求解最短路径问题，这个算法是我自己编出来的 ，感觉有很多冗余之处，请大家一起改正-Using Dijkstra shortest path algorithm, this algorithm is out of my own, I feel a lot of redundancy, please everyone together to correct