serversock

八种排序的方法,利用VC++实现,值得借鉴-eight ranking, using VC, which is worth learning from

这个程序是按照离散数学教材上给出的算法写的，是字典序的全排列算法。空间复杂度是O(n)，时间复杂度基本上是O(n^2)。缺点是只用于打印并没有储存所有的结果。-the procedure is in accordance with the materials on discrete mathematics algorithm is written, is a wholly-lexicographic order algorithm. Space complexity is O (n), is basically time complexity is O (n ^ 2). Only drawback is not for print, and store all the results.

经典的八皇后问题，结合MFC界面编程，能够清晰看到皇后的排列位置。-eight Queen"s classic, combining MFC programming interface, can see clearly what the position with the Queen.

数据结构栈队列-车场管理-queue data structure stack-Yard Management

本程序集合了数据结构8种主要的排序方法：插入排序、冒泡排序、选择排序、快速排序、希尔排序、堆排序、归并排序、基数排序。-the procedures set of data structure of the eight major sequencing method : Insert ranking Bubble Sort, select, in order of Quick Sort, Hill sequencing, heap sort, merge, in order of ranking base.

一个用来检查数据重复性的存储过程-one used to check the repeatability of data storage process

VC++下的不规则三角网生成算法,这是不规则三角网的生长算法,通过建立TIN类,在TIN类内实现一些方法.-VC under the TIN generation algorithm, which is triangular irregular network growth algorithm, through the establishment of TIN category, the category TIN achieve some ways.

以十字链表表示稀疏矩阵,实现两个矩阵的相加,相减,和相乘的运算.-List said with a crossbow sparse matrix, the matrix to achieve two together, subtraction, multiplication and arithmetic.

这是我在英国的C语言导师自己所写的一个二叉树的程序。-This is a binary-tree programme written by my tutor in England.

关于三层架构的内容参考，三层架构的大致结构内容-With regard to the contents of the reference three-tier architecture