SHU

此程序用于解决8皇后问题，运行后输出8皇后问题的所有解(This program is used to solve the 8 queens problem, all solutions of 8 queens problem output operation.)

大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)

在VC中实现Bresenham算法画直线(Bresenham algorithm in VC draw a straight line)

霍夫曼编码实验报告，内含源代码，编码原理 (Huffman coding lab report, containing the source code, coding theory)

组合数学全排列,包含有六种全排列的方法，字典序法(math of permutations)

数据结构与算法综合资料库,是一本很好的学习计算机的基础教程(Data Structures and Algorithms General database, are a very good tutorial to learn basic computer)

设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)

迷宫问题c源代码，大小为8*8的迷宫。主函数中输入开始位置和结束位置的坐标，输出所有可能的路径(Maze c source code, size 8* 8 of the maze. Enter the start the main function of the coordinates of the position and end position, the output of all possible paths)

数据结构c源代码实现，大概有100个左右，基本上将所有的数据结构都有介绍(Data structures c source code to achieve, there are about 100 or so, basically all of the data structures are described)

哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，