erchashu

数据结构中的一元多项式相加，多于考研算法实现很重要。后续部分将在后期上传！(The sum of Multinomial)

数据结构课程设计，在VC环境下完成，利用哈夫曼树原理，主要功能是实现字符的压缩和解压缩，设计脉络清晰，易懂(Data structure course design, completed in the VC environment, using Huffman tree principle, the main function is to achieve the character of the compression and decompression, design, clear structure, easy to understand)

用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)

迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

说明：  数据结构课上作业实现了一个多项式乘法的功能有注解(Job class data structure implements a polynomial function of multiplication comments)

本程序解决的是：模拟类似计算机主、缓存的存储结构，当用户请求某个页面时，若某个页面已在缓存中，则直接从缓存中去取，不会产生失误（即未在缓存中命中），否则，就到主存中去取，代价变大。 本程序采用随机标记算法，即在在线标记算法的基础上，对于替换页面时，采用随机从未标记的缓存项中选出一项进行替换。 代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)

二叉树的打包数据结构，包括遍历，删除，添加，注释详细(Packaged binary tree data structure, including traversal, delete, add, annotate details)

说明：  有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

这是一个二叉树的工程文件，包括了工程文件里的所有文件。以及二叉树的构建，traverse，搜索等功能函数。(This file contains a summary of what you will find in each of the files that make up your bTree application. )

约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)