3种简单排序及堆排序、shell排序、快速排序、归并排序。二查搜索树的建立、遍历及插入、删除结点-Three kinds of simple sorting and heap sort, shell sort, quick sort, merge sort. Two investigations to establish the search tree traversal and insert, delete nodes

利用快速局部搜索算法，在几秒内解决百万皇后问题-solve the million queens problem in just a few secs.