sort

Huffman编码与译码，实现数据结构树的功能。(Huffman coding and decoding, data structure tree functions.)

随机函数产生10000个随机数，用快速排序、直接插入排序、冒泡排序、选择排序的排序方法排序，并统计每一种排序所花费的排序时间和交换次数。其中随机数的个数由用户定义，系统产生随机数。(Random function generates 10,000 random numbers using quick sort, insertion sort, bubble sort, select Sort sort Sort, and statistics for each sort spend the sort of time and the number of exchanges. Wherein the number of the random number defined by the user, the system generates random numbers.)

上海交通大学数据结构课程的课后作业系列3.5：仅供参考，最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)

VC++常用的数据结构类源码 这是我在VC++日常开发中收集的一些经常用到的类库，每一款都可以轻松重用，这些类库适用于vs2003及以上的开发环境，其中 Thread 和 Delegate 是从C#中得到的灵感，还有一些是在使用开源代码或其它语言时得到的启发和灵感。个人认为部分代码还算好用，所以拿来分享一下。部分类库附带有例子，欢迎参考。 (Commonly used data structures in VC++ class source This is the daily development of VC++ I collected some frequently used library, each designed to easily reuse these libraries apply to vs2003 and development environment, including Thread and Delegate inspiration from C#, there are some inspired use of open source code or other languages ​ ​ and inspiration. Personally think that part of the code is fairly easy to use, so used to share. Some class library included with examples for reference.)

键盘任意输入一组字母或数字生成无序数组，对数组按ASCII顺序进行排序（排序要求至少用两种排序算法），再从键盘输入一个值进行二分查找，返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)

实现超市中排队购物用时最短，是计算机算法设计与分析中的一道题。自己写的程序，原创！(Achieve queued supermarket shopping with the shortest, is a question in the design and analysis of computer algorithms. Write their own procedures, original!)

基于数据结构的图书管理系统，基本功能都有，可以拿来作为数据结构的课程设计(Based library management system data structures, basic function, can be used as a data structure of the curriculum design)

几个比较好的初级算法，初学者可以看一下思想，对算法入门(A few good elementary algorithms, beginners can look at thinking on algorithms entry)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

本实验设有一个线性表，分别实现数组结构存储的原地逆置。为数据结构课程必做实验。(This experiment has a linear form, respectively, to achieve the storage array structure in situ reverse home. For the data structure courses will do the experiment.)