array assignment is well

给定一个（无向）图G，及G中的两点s、t，确定一条从s到t的最短路径。-Given a (undirected) graph G, and G in two points s, t, determined from s to t of a shortest path.

数据结构（C＋＋版）的演示程序，详细演示归并排序的具体调用过程-data structure (C++ version) demonstration program, a detailed presentation of specific merge sorting process called

数据结构，清华大学出版社，课件，严蔚敏编著-Data structure, Tsinghua University Press, courseware, edited by Yan Wei-min

java中几种常用的排序算法。 用Java语言实现的各种排序，包括插入排序、冒泡排序、选择排序、Shell排序、快速排序、归并排序、堆排序、SortUtil等。-java of several commonly used sorting algorithm. Using Java language to achieve a variety of sorting, including the Insertion Sort, Bubble Sort, Selection Sort, Shell Sort, Quick Sort, Merge Sort, Heap Sort, SortUtil such.

对N皇后问题进行优化，可以在较短时间内计算出皇后排列方法的个数-Optimized for N queens problem, you can calculate the Queen in a relatively short period of time means the number of ordered

merge sort give a set S of n integers and another integer x, determine whether or not there exits two elements in S whose sum is exactly x.-merge sort give a set of S n integers and anot her integer x, determine whether or not there exits two elemen ts in S whose sum is exactly x.

哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，

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

UTE - (U)niversal ASP (T)able (E)ditor 万能数据管理（管理后台）-oldest- (U) niversal ASP (T) able (E) Editor omnipotent data management (management background)

穷举密码算法 /在许多情况下我们需要穷举组合的算法，比如密码词典。 //这个算法的关键是密码下标进位的问题。 //另外本例子中的写文件语句效率比较低，为了降低算法复杂度没有优化。 //如果要提高写文件的效率，可以使用缓冲区，分批写入。-Exhaustive Cipher/In many cases we need to exhaustive combinations of algorithms, such as the password dictionary.// This algorithm, the key is password subscript binary problems.// Another example of this statement to write a document relatively low efficiency, in order to reduce the algorithm complexity is not optimized.// If you want to improve the efficiency of writing documents, you can use the buffer, write in batches.