datastructimplement

数据结构课程设计，多种内部排序的效率分析(Data structure course design, the efficiency of a variety of internal sorting)

猴子选大王是个重要问题猴子选大王是个重要问题猴子选大王是个重要问题(houzixuandawang)

用不多于四种颜色为地图染色，使相邻的行政区不重色，是计算机科学中著名的“四染色”的典型应用，应用这个思想，是以回溯的算法对一幅给定的地图染色。是对数据结构中栈的应用。(With no more than four colors map staining the adjacent borough is not heavy color, typical applications of computer science "stain" the application of this idea, a backtracking algorithm on a given mapstaining. The application of the stack data structure.)

工作时单元功能实现的部分资料 主要涉及字符串处理、排序算法，字符串查询、kmp、改进二分法、Unicode编码、uniq(functional modules work to achieve some of the information involved mainly string handling, sorting algorithm, string inquiries, kmp improve dichotomy, Unicode encoding, uniq)

数据结构中，运用链表实现四则括号运算等，运行在VC控制台上。(Data structure, the use of chain operations to achieve four brackets, etc., running in the VC console.)

找出数组A中最长的递增序列的长度，使用动态规划算法，复杂度为O(N*N)。(Find the longest increasing sequence)

大学计算机专业教材《数据结构》中栈的实验、练习源码(University computer professional teaching materials" data structure" stack experiment, practice source code)

这个程序是有关计算机的动态内存分配的数据结构 可以直接加载头文件与源文件即可使用其中的接口(This program is a data structure for dynamic memory allocation of the computer can directly load the header files and source files you can use one of the interfaces)

用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))

演示进程调度算法 使用的链表 包涵7个功能 4个算法(Process Scheduling Algorithm Demo )