zhaose

本程序解决的是：模拟类似计算机主、缓存的存储结构，当用户请求某个页面时，若某个页面已在缓存中，则直接从缓存中去取，不会产生失误（即未在缓存中命中），否则，就到主存中去取，代价变大。 本程序采用随机标记算法，即在在线标记算法的基础上，对于替换页面时，采用随机从未标记的缓存项中选出一项进行替换。 代码、文档详尽(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)

说明：  数据结构基本算法实现。包括栈、二叉树基本运算实现，同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)

说明：  、实验目的 1 熟练掌握各种内排序方法，深刻理解排序算法及其执行过程； 2 学会分析各种内排序算法的性能； 3 了解各种排序方法的优缺点，对于实际问题能够选择一种较好的排序方案； 4 熟练掌握图的存储结构； 5 掌握图的邻接矩阵和邻接表表示分别进行深度和广度优先搜索遍历的算法。 6 了解图的最小生成树算法。 (Proficiency in the order of search, binary search and index search basic search algorithm, these algorithms are familiar with what kind of storage structure suitable for implementation two master binary sort tree characteristics, building methods, and dynamic search algorithm 3 master hash table of characteristics and construction methods.)

这是一个实现找出欧拉路径的的算法，比较完美的解决了欧拉算法(This is an implementation of the algorithm to find Euler path, the more perfect solution to the Euler algorithm)

约瑟夫问题，用数据结构的循环链表实现约瑟夫问题的解答(Joseph problems，30 people in a circle, and inspires us with a circular chain to said. Can use structure array to make a cycle chain. The structure has two members, one for pointing down a pointer to a circular chain )

该文件描述了排序算法的实验指导报告，通过本实验，你可以了解插入排序、选择排序、希尔排序、堆排序、冒泡、双向冒泡、快速排序、归并排序、递归的归并排序、基数排序等多种排序方法的实验(The document describes the experimental guidance of the sorting algorithm, through this experiment, you can learn about the insertion sort, selection sort, shell sort, heap sort, bubble, two-way bubble, quick sort, merge sort, merge sort recursive basesorting a variety of sorting methods experiment )

算法导论的英文版，讲解算法的非常经典的书。(English version of Introduction to Algorithm. A classical book to teach algorithm.)

包含了数据结构实现堆栈的方法。 主要有链表实现和数组实现以及堆栈的应用。(This pakcet inclues the programs to implement the stack with chain and array and it s application.)

基于Hash表的程序同源性分析,可以利用本程序进行两个程序源码比较相似度(Homology analysis Hash Table-based program, you can use the program two program source code similarity)

用哈夫曼编码的方式进行图像的压缩，其中定义了一个cdib的类，通过之类来对图像进行处理(image coding in haffman)