-
RBtree
使用C++/C语言实现的红黑树,对于数据结构的学习有所帮助。(Use red-black tree C++/C language for learning data structures helpful.)
- 2014-05-16 16:09:57下载
- 积分:1
-
listnode
C++中,对链表的增删改查的基本使用,值得学习(C++, on the list of CRUD basic use, it is worth learning)
- 2015-08-05 17:57:12下载
- 积分:1
-
ok-suit
说明: 一个实现外部排序的程序,其中gnerate.cpp为产生一个随机的文件,用于被排序。而caculate.cpp为外部排序程序。(A realization of the external sort program, which gnerate.cpp to generate a random file for be sorted. The caculate.cpp external sort program.)
- 2011-03-18 12:30:29下载
- 积分:1
-
yongzhanshixianleicaozuo
自己做的一个用用栈实现类的操作,是课内作业,希望和大家互相交流(Own a type used by the realization of the operation of the stack is class work, hope and we can exchange ideas)
- 2007-12-25 22:28:05下载
- 积分:1
-
Sort
排序程序,包含快速排序、归并排序、谢尔排序、插入排序。输出了比较次数和移动次数。(It is a sort program, including quick sort, merge sort, shell sort and insert sort.It outputs the compare times and movement times.)
- 2009-05-24 18:53:10下载
- 积分:1
-
KMP
数据结构中KMP算法c语言实现,vc6.0环境(KMP algorithm in c language data structure, vc6.0 environment)
- 2013-03-27 14:04:39下载
- 积分:1
-
KMP---MFC
数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)
- 2020-07-04 08:40:01下载
- 积分:1
-
Online_RandMarkingAlgorithm
本程序解决的是:模拟类似计算机主、缓存的存储结构,当用户请求某个页面时,若某个页面已在缓存中,则直接从缓存中去取,不会产生失误(即未在缓存中命中),否则,就到主存中去取,代价变大。
本程序采用随机标记算法,即在在线标记算法的基础上,对于替换页面时,采用随机从未标记的缓存项中选出一项进行替换。
代码、文档详尽(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)
- 2012-09-19 13:01:47下载
- 积分:1
-
maze
迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(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.)
- 2013-12-13 17:55:45下载
- 积分:1
-
BinaryTree
数据结构使用三叉链表表示的二叉树的基本操作(Data structures using the binary tree expressed in the trigeminal lists the basic operation of)
- 2010-06-26 10:51:43下载
- 积分:1