101Csharp 代码示例

MyDB 是一个小型、 快速、查询方便的桌面数据库。 适用于Visual C++、Visual Basic、Delphi等开发者。 只有一个DLL（188KB），所有数据以自己的格式存 在一个普通文件中，无需Dao、Ado、BDE等支持。 也无须任何安装和设置。特别适合开发那些数据量 不是很大，无需复杂查询，又不想安装Dao等一大堆 DLL，OCX的绿色软件。而且数据安全性好， 无法轻易打开！-MyDB is a small, fast and convenient desktop database query. Applies to Visual C++, Visual Basic, Delphi and other developers. There is only one DLL (188KB), all data in their own format, there is a general document, without Dao, Ado, BDE and other support. Also without any installation and settings. Particularly suitable for the development of those who is not a big amount of data without the complexity of inquiries, but also do not want to install a lot of Dao, such as DLL, OCX green software. And data security, and can not be easily opened!

我自己写的数值分析课程设计的算法，这里是数值拟合的部分。-I wrote it myself numerical analysis courses designed algorithm, which is part of the numerical fitting.

单链表简单基数排序，关键字有三个，参与排序的关键字的值为0-9之间的数-Simple single-chain base sequencing, there are three keywords to participate in the value of the keyword ranking for a number between 0-9

实现拓扑排序，用到了堆栈，存储结构采用邻接表。-To achieve topological sorting, use the stack, storage structure using adjacency list.

这些都是金典的c语言的例子，是语言学习者的必备-These are the c language examples of the sort of language learners

这是用java实现的一个人员管理系统的例子，可以实现人员管理-This is a java implementation of the personnel management system, examples of personnel management can be achieved

超市选址，用数据结构，求最小生成树问题。自设计算法为超市寻找一个最短路径。-Supermarket site, the data structure, and minimum spanning tree problem. Since the design of algorithms for the supermarket to find a shortest path.

Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a

马的遍历问题。在中国象棋棋盘上，对任一位置上放置的一个马，均能选择合适的路线，使得该棋子能够按象棋的规则不重复的走过棋盘上的每一个位置。-Traversal problem horses. In Chinese chess chessboard, for any one location to place a horse, able to choose the right line, making the chess pieces according to chess rules can not repeat the past chessboard for each location.

用循环链表解决约瑟夫环问题。对学习循环链表有很大帮助-By cyclic list Joseph Central problem to solve. Learning cycle has a great list to help