用C#实现的连接数据库,然后可以些SELECT语句来实现查询!

0-1背包问题，用VC++实现，是算法设计中比较重要的问题-0-1 knapsack problem, using VC++ Realize is that algorithm design more important issue

摘要 　? 　? 　　 　　设计时的自动化加快了编码，并保证所有过程都用相同的命名规范和结构来生成。为了在大型 SQL 项目中尽量提高编码的效率，作者编写了一系列的设计时（design-time）存储过程，用它们来生成运行时（run-time）存储过程，并一直在工程中使用。最近，作者更新了其存储过程以便使用 SQL Server 2000 的特性，其中包括用户定义函数。本文所及内容涵盖创建并执行这些动态 T-SQL 脚本以使普通的数据库存储过程编码自动化。- Time the abstract design automation sped up the code, and guarantee all processes all use the same naming standard and the structure produce. In order to enhances the encoded efficiency as far as possible in the large-scale SQL project, the author has compiled when a series of designs (design-time) saves the process, produces when the movement with them (run-time) saves the process, and always uses in the project. Recently, the author renewed its memory process in order to use SQL the Server 2,000 characteristics, including user definition function. This article institute and the content cover founds and carries out these dynamic T-SQL script to cause the ordinary database memory process code automation.

Visual C#数据库开发中 简单论坛的开发sql2000数据库-Visual C# Database development in a simple forum for the development of SQL2000 database

本程序实现各种排序算法并分析与比较 直接插入排序， SHELL排序，冒泡排序，快速排序，简单选择排序，堆排序，归并排序-procedures for the realization of the algorithm and analysis more directly inserted, in order of ranking SHELL, Bubble Sort, rapid sequencing, simple choice, in order of ranking sculpture, merging Sorting

0-1背包和 背包问题的动态规划 源程序 只是测试 不过要自己输入 还要自己加入 很简单就没有更改-0-1 knapsack problem knapsack and the dynamic programming source code is to test but also to input their own entry is very there is no simple changes

这是数据结构中图的全部实现代码，对学习数据结构的同学很有帮助-this is a code of data structure

数据结构课程设计题，用C++语言实现二叉排序数，并对二叉排序数进行，插入，删除，修改等操作-insert delete change

动态规划的石子问题算法下载压缩包后，解压，使用vc-stones dynamic programming problem packet compression algorithm download, extract, use vc

数据结构经典：《数据结构基础》 "Fundamentals of Data Structures" 作者：Horowitz 1983年第一版-Classical data structure:

oracle问题集，适合初学者-problem sets, suitable for beginners