搜索资源列表
dashujiecheng
- 该源代码利用计算机模拟乘法竖式 计算阶乘 将每位数子保存在用new分配的一长字符数组里 在本人的机子上可计算30000!的精确值 用时近60秒-the source code used a computer simulation multiplication calculation factorial shaft will be preserved for each digit used in the distribution of a new long arrays of characte
蕊
- 学校景点分布图最佳路径选择，通过最短路径选择让游者能够自由选择最佳观赏路径-schools attractions distribution choose the best path through the shortest path chosen You can watch free to choose the best path
强盗分金算法
- 10名海盗抢得了窖藏的100块金子，并打算瓜分 这些战利品。这是一些讲民主的海盗（当然是他们自己特有的民主），他们的习惯 是按下面的方式进行分配：最厉害的一名海盗提出分配方案，然后所有的海盗（包 括提出方案者本人）就此方案进行表决。如果50%或更多的海盗赞同此方案，此方 案就获得通过并据此分配战利品。否则提出方案的海盗将被扔到海里，然后下提名 最厉害的海盗又重复上述过程-10 pirates seize a cache of 100 gold, and plan t
NudtCommonTree
- 由STL扩展的树范型。该范型支持边的加权。树封装了内存管理，使得程序员免予释放、分配节点内存。附有实例程序-STL extended by the tree-Fan. Fan support for the type of edge-weighted. Tree Packaging, a memory management, allowing programmers to exempt from release, distribution nodes memory. With examples
shunxux
- 是一个数据结构中关于连续的分配的线形分配的数据结构及一些基本操作-is a data structure for the distribution of the linear distribution of the data structure and some basic operation
sjjgcyygp
- 本光盘是《数据结构(C语言版)》一书的配书光盘，作为数据结构课程的 辅助学习工具。-the CD is "data structure (C-language version)," a book on CD-ROM distribution, as a data structure courses assisted learning tools.
均匀分布和高斯分布
- 均匀分布和高斯分布的C代码-uniform and Gaussian distribution of C code
数理统计
- 所有数理统计知识的源代码都在此,是一本数理统计数的配套光盘.里面有各种分布类型及参数估计\\插值-all mathematical statistical knowledge of the source code here is a mathematical statistical matching CD. There are various types and the distribution parameter estimation \\ interpolation, etc.
distsort
- 该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it's time complexity of O (n), but this sort known to be
gelei combination
- 该程序用格雷码来生成组合数序列,它比一般的方法要快,这是由格雷码的分布特性所决定的.-the procedures used to generate Gray code sequence portfolio, it generally means than to be fast, it was a Gray code distribution by the decision.
APhash.rar
- 常用的hash算法APHash，该hash算法可以实现均衡分布，让数据均匀的分布在hash列表中,Commonly used hash algorithms APHash, the hash algorithm can achieve a balanced distribution, so that uniform distribution of data in the hash list
MCB
- 实现动态分区内存管理： 1.数据结构、分配算法设计 2.加深对动态分区存储管理方式及其实现过程的理解。 -Dynamic partition memory management: 1. Data structure, distribution algorithm 2. Better memory management for dynamic partitions and its realization process of understanding.
yinhangjiasuanfa
- 利用银行家算法实现资源分配。当某个进程提出资源请求是，假定先分配给它，然后查找个进程的请求，检查系统剩余资源是否由于分配而导致思死锁。若是则该进程等待；否则，为其进程所需资源。-Bankers algorithm using the allocation of resources. When a request is put forward the process, it is assumed that first be allocated to it, and then find a proc
dongtaifenqucunchumoni
- 通过程序模拟了动态分区分配方式，进而帮助理解动态分区分配方式中使用的数据结构和分配算法-The adoption of procedures to simulate the distribution of dynamic partitioning approach to help understand the dynamic partitioning allocation methods used in data structure and distribution algorithm
banker
- 银行家算法的基本思想是分配资源之前,判断系统是否是安全的 若是,才分配。它是最具有代表性的避免死锁的算法-Banker' s Algorithm The basic idea is the allocation of resources, are to determine whether the system is safe If so, before the distribution. It is the most representative of the algorithm to
os5
- 设可供分配的内存储器为1MB(1000KB),内存分配采用动态分区分配策略，分区分配的数据结构为空闲分区链，分配算法采用首次适应算法(FF) 系统仅有一个CPU；作业提交时申明需要的CPU时间和内存大小(以KB为单位)。-Located within the memory available for allocation to 1MB (1000KB), memory allocation dynamic partition allocation strategies, area distrib
rbtree
- 红黑树是一种自平衡二叉查找树，是在计算机科学中用到的一种数据结构，典型的用途是实现关联数组。-AVL trees are actually easier to implement than RB trees because there are fewer cases. And AVL trees require O(1) rotations on an insertion, whereas red-black trees require O(lg n). In practice, the
DistributionMission
- 输入人数，输入将要分配的工作数目，输入第i人干第j项工作的经费消耗，调用处理模块BackTracking输出最优分配方案。-Enter the number, type of job distribution to the number of people do i enter the first section of the work of j-expendable funds, call processing module output BackTracking optimal distri
0-1package
- 在0和1情况下进行背包问题解决，涉及多个物体的重量和价值，求得最大价值量以及分配方案。-At 0 and 1 backpack case for problem-solving, involving more than the weight of objects and values, as well as to achieve maximum value distribution program.
dijkstra_i_path
- dijkstra 最短路径算法在铁路路网规划上的简单实现(dijkstra algorithm on railway distribution)