资源列表
datastructure
- 各类数据结构的功能实现，包括线性表，树，图几种数据结构-Function of various types of data structures
Doug-Leas-DLMAlloc
- memory malloc manager-Doug Lea s DLMAlloc
shujuqingxihao
- 数据清洗，出去不需要的数据，简单好用，希望喜欢-Data cleansing, data do not need to go out, easy to use, I hope like
algorithm
- 很实用的算法分析包括应用算法的一些程序，对学习算法的朋友一定有用。-Very practical application of algorithm algorithms analysis includes some of the procedures, the learning algorithm s friends must be useful.
liangxi
- 求两个整数的最小公倍数的简单的算法代码，辗转相除法-Least common multiple of two integers a simple algorithm code, the Euclidean algorithm
How-c-language-FLOAT-are-represented
- c语言中FLOAT 是如何表示的？尾数，阶码是如何在32位上安排的，即哪几位是 尾数，哪几位是阶码，那一位是符号位。-How c language FLOAT are represented? Mantissa, exponent is how 32-bit on the arrangement, that is what several of the mantissa, which is the order of a few yards, then a is the sign bit.
3
- 编程实现四种调度算法 编程实现四种调度算法： (1) 先来先服务算法 (2) 短作业优先算法 (3) 优先权算法 (4) 基于时间片的多级反馈队列算法 -Programming implement four scheduling program implement four scheduling algorithms: (1) first come first serve algorithm (2) short jobs first algorithm (3) prior
4
- 编程实现银行家算法 通过实例模拟银行家算法实现死锁预防。 掌握银行家算法实现死锁预防的原理 要求：输入实例，能够使用银行家算法判断资源分配后是否存在安全序列。 -Programming by example simulation banker bankers algorithm deadlock prevention algorithm. Master bankers, deadlock prevention algorithm principle requirements: i
6
- 页面置换算法理解页面置换算法,实现先进先出（FIFO）置换算法和最久未使用（LRU）置换算法。给出任意的输入流，计算置换次数。-Page replacement algorithms understand page replacement algorithm, first in first out (FIFO) replacement algorithm and least-recently used (LRU) replacement algorithm. Any given input st
7
- 编程实现SSTF算法和SCAN算法 掌握SSTF算法和SCAN算法的原理，并编程实现-Programming algorithm SSTF and SCAN algorithms SSTF and SCAN algorithms to master the principles of algorithm and programming
1
- 进程状态迁移.写一个程序描述进程状态迁移过程，理解进程概念、状态转换及其控制-Process state transition. The process of writing a program that describes the status of the migration process, the process of understanding the concept of state transition and its control
Floyd
- 最短路径的常见算法，能够算出图中所有节点之间的最短路径（时间复杂度为o(n^3)）-Common shortest path algorithm