客户管理系统使用ASP.NET和Acce

一个快速排序算法的实现例子，数据结构课程作业，可作研究学习之用。 包含源文件和详细的开发文档，可方便移植到C等语言平台。-a fast algorithm to achieve example, the data structure course work and can be used for research and study purposes. Includes source document and detailed documentation, will facilitate the transplantation of languages such as C platform.

我写的数据结构小程序是关于排序算法的，功能比较全-I write the data structure of small programs algorithm, the entire comparison function

一个三层应用程序，演示如何通过ADO对象以及存储在SQL Server中的Procedure实现高性能的数据访问(在运行程序前首先要设置SQL Server，在压缩包中有一个Procs.sql的文件，首先在SQL Server上运行该文件设置SQL Server数据库)-a three-tier applications, demonstrating how ADO and SQL Server stored in the Procedure to achieve high-performance data access (in the first before running the program to set up SQL Server, in a compressed Procs.sql a document, the first in SQL Server running on the document set up SQL Server database)

数据结构作业题，堆栈和队的使用（大写字母表示魔王语言的词汇；小写字母表示人的词汇语言；魔王语言中包含括号）-Title data structure operations, the stack and force the use of (capital letters that devil language vocabulary lowercase letters that people s vocabulary language devil language contained in brackets)

本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source

数据结构 八皇后问题解决方案一 很好的代码-8 Queen" s problem of data structure of a solution

清华版的数据结构要求的实验 此为广义表的程序-Qinghua version of the data structure required for this experimental procedure generalized Table

给定n 个整数a ,a , ,an 1 2  组成的序列， a n i | |£ ，1 £ i £ n。如果对于i £ j ，有 0 = å = j k i k a ，则称序列区间i i j a , a , , a +1  为一个零和区间，相应的区间长度为j-i+1。-given n integers a, a, and an 1 2

设有由n个不相同的整数组成的数列，记为: a(1)、a(2)、……、a(n)且a(i)a(j) (ij) 例如3，18，7，14，10，12，23，41，16，24。 若存在i1

有许多是考研要用的！三路归并算法，快速排序的非递归算法，无向连通图的非递归的深度优先遍历等，，希望大家用得着-many are taking tests to use! Three road merging algorithm, rapid sequencing of non- recursive algorithm, undirected graph of the non- recursive depth-first traversal, and we hope that it needs! !