八皇后问题，用vc编写了一个可以解决八皇后问题的程序，实现了递归调用。...

提醒的例子，大家可以去看看 -Remind example, we can go and see

八皇后问题：用回溯算法做的 -8 Queens : The backtracking algorithm

Its about data structure Tr-Its about data structure Tree

创建和修改自定义的数据库-Create and modify selfdefined database.

documents classification and words statiscs TF/IDF etc

ssd7的本人的答案， 供大家参考, 希望大家喜欢-ssd7 exercise1

实现了插入排序，希尔排序， 冒泡排序，快速排序，选择排序，堆排序和归并排序，以及可以对排序的性能进行分析，较适合用作排序算法的学习-achieved insertion sort, Hill, in order Bubble Sort, quick sort, select, in order of ranking and sculpture merge sorting, and sequencing can analyze the performance and more appropriate for the learning algorithm

数据结构：队列程序-data structure : queue procedures

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)

表达式求值是程序设计语言编译中的一个最基本问题，它的实现是栈的应用的典型例子。-Expression evaluation is a programming language compiler in a fundamental question, and its implementation is a typical example of the application stack.