资源列表
bessik23
- fortran bessik三分之二阶算法实现-fortran for modified bessik 2/3 order code
Disk-scheduling-
- 编程序实现下述磁盘调度算法,并求出每种算法的平均寻道长度: 1、先来先服务算法(FCFS) 2、最短寻道时间优先算法(SSTF) 3、扫描算法(SCAN) 4、循环扫描算法(CSCAN)-Disk scheduling
A-Hybrid--Energy-Efficient--Distributed.-
- A Hybrid, Energy-Efficient, Distributed. Clustering
Algorithm-Notes
- Algorithms basics and easy way to understand them.
Arithmetic-Coding
- Brief explanation with respect to Arithmetic coding an application in Data Compression, is given
PSO-process-and-source-code
- 粒子群算法的核心思想,流程及主要程序代码-The core idea processes and the main program code of the particle swarm algorithm,
Biggest-rectangular-area
- 最大矩形面积计算,计算相邻矩形中的最大面积-Largest rectangular area
hdj
- 杭州电子科技大学ACM2013、2045、2049、2059、2074参考代码,供大家下载参考-Hangzhou University of Electronic Science and Technology ACM
main.cpp
- 三个人吃苹果问题的c++实现,资料的详细功能、包含内容说明(至少要20个字)。-tree people eating appales c++
1-10
- 题目:有1、2、3、4个数字,能组成多少个互不相同且无重复数字的三位数?都是多少?题目:企业发放的奖金根据利润提成。-Topic: 1, 2, 3, 4 Numbers, how many can form a different from each other and have no the repeat number three digits? How much be? Topic: enterprise extending bonus profits according to the co
11-20
- 题目:古典问题:有一对兔子,从出生后第3个月起每个月都生一对兔子,小兔子长到第三个月后每个月又生一对兔子,假如兔子都不死,问每个月的兔子总数为多少?-Topic: classical question: have a rabbit, from birth after 3 months on every month were born a rabbit, little rabbit to the third month after smaller every month and born a ra
lcg
- Will any certificate N decomposition into many different from each other 将任意证书N分解成多个互不相同的正整数的和,并打印所有可能的组合方式。例如N=6,组合方式有1+5,2+4,1+2+3。 -possible combinations. Such as N = 6, combinations have 1+ 5, 2+ 4, 1+ 2+ 3.
