资源列表
4zhongyemiandiaodusuanfa
- 基于一个虚拟存储区和内存工作区，设计下述算法并计算访问命中率。 1、最佳淘汰算法（OPT） 2、先进先出的算法（FIFO） 3、最近最久未使用算法（LRU） 4、简单时钟(钟表)算法（CLOCK） 命中率＝１－页面失效次数／页地址流(序列)长度 -Based on a virtual memory storage area and work area, the following algorithm design and calculate the h
The_Magical_Splay
- Splay 伸展树经典教程，含有论文和源代码。ACM金牌必备。-A Splay tree director for ACMer who wants to get a medal,include PDF and souce code
Splay-for-number-list
- 伸展树Splay在数列处理问题上的应用的教程与源代码，含有pas和cpp。-A director of Splay tree for the usage to solve the problem with number list
Bankers-algorithm
- 计算机操作系统实验。用c++编写的银行家算法程序，内附运行截图。运行时将源程序直接复制粘贴到编译器，保存为.cpp文件即可。-Computer operating system experiment. Written by c++ bankers algorithm, enclosing run shot. Runtime copy and paste the source code to the compiler directly, save it as a. Cpp file.
baoshu
- 报数问题。n个人围成一圈，1，2，3循环报数，报到3的人退出。到最后只余1人，输出最后留下的是第几号（最初的序号，以1起始）。压缩包内共三种方法。-Reported several problems. n personal circle, 1,2,3 newspaper circulation numbers, to report three people quit. To the final with only one person, the output of the last to lea
Josephus-Problem
- 约瑟夫问题的链表实现，包含源代码（c语言实现）-solve of Josephus Problem
SVM(SMO)分类器
- JAVA语言编写的SVM分类器，附带源代码，可直接运行
Joseph-ring
- 数据结构链表经典习题约瑟夫环,包涵其实现的源代码，在VC++6.0下运行就可实现-Linked list data structure classic exercises Joseph ring, with the realization of the source code, running under VC++6.0 can be achieved
contraction_hierarchies-master
- 实现了dijstra算法的c++代码,但是计算速度不是很理想-Achieved dijstra algorithm c++ code
contacts
- 用链表建立通讯录，C语言，链表，可创建，插入，删除，查找-Establish contacts, C language, the list with the list, you can create, insert, delete, search
contacts
- 用顺序存储结构建立通讯录，C语言，可创建，插入，删除，查找-Establish contacts with sequential storage structure, C language, you can create, insert, delete, search
HuffmanTree
- 静态建立Huffman树，数据结构，静态，huffman树-Static build Huffman tree data structures, static, huffman tree