实现线性表的创建、删除、插入、遍历操作，方便大家使用

哈夫曼树及哈夫曼编码，经过测试可用的，快来下载啊！-Huffman trees and Huffman coding, tested available, Come download ah!

C++写的归并排序算法，非递归，简单高效-the nonrecursive code of mergesort

约瑟夫环 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。（有详细注解）数据结构学习的好例子-Joseph ring known n individuals (identified by serial number 1,2,3 ... n, respectively) were sitting around on a round-table. K from the number of people reported a few, a few of the m out of that person him from one of the next person to start off, a few m to another person out and so the law of repetition until around round-table All of the people out. (Detailed notes) data structure to learn a good example of

四种排序算法(交换排序 冒泡排序 quick sort排序 mergesort归并排序 )源码，以及各种算法排序效果的对比。-Four kinds of sorting algorithms (exchange sort bubble sort quick sort sort mergesort mergesort ) source code, as well as comparison of various algorithms to sort results.

PFC实例是参照PB6.51版本的PFC的example做的，里面的注释基本都是用中文重新写过，方便大家阅读，本PFC实例没有使用SQLSPY、DEBUG服务和数据窗口属性服务，但是增加了一些实例，如：带进度条的检索工具，SQL语法分析，数据窗口缓存服务等。-PFC PB6.51 example is the reference version of the example of PFC done inside of the Notes which are re-written in Chinese, facilitate reading, the examples do not use PFC SQLSPY, DEBUG window service attributes and data services, but an increase of some examples, such as : the progress of the band Search tools, SQL syntax analysis, data window cache services.

应用背景一个学生只允许一个月申请一次。特点：学生1）注册2）登录3）请求离开4）休假状态5）查看简介6）编辑配置文件7）更改密码关键技术管理：1）批准休假2）拒绝离开3）编辑离开时间4）查看学生简介5）编辑学生简介6）学生的地位主要特点：一个学生只允许一个月申请一次。

这是一个数据结构演示系统，可以演示二叉树、二分查找等数据结构-This is a data structure presentation systems, you can demo binary tree, binary search data structure, etc.

学生成绩管理系统可以输出学生姓名，学好，语文，数学，英语，还要用链表把成绩从高到低输出-Student management system

一个包装好的树型模板类,可以实例化树型数据结构.-a packed tree template category, examples of the tree data structure.

设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main function of the input data for testing