搜索资源列表
Joseph-Ring
- 用c语言,实现了,于瑟夫环。要到了数据结构中的链表。-With the c language to realize, in the Joseph ring. To go to the linked list data structure.
Design-and-Analysis-of-Algorithms
- 《算法设计与分析》的电子课件,爱好编程并且打算深入的人值得学习-" Algorithm design and analysis of" electronic courseware, loving people who go into the programming and worth learning
LS_SVMlab(1)-matalb
- 采用某种算法对样本进行分类,当有新的样本时把它们归到哪一类中,可以采取一些工具箱-Using an algorithm to classify the samples, when new samples to a class where they go, you can take Toolbox
AVLtree
- 数据结构AVL树,实现了AVL所有的功能,。在AVL树中任何节点的两个儿子子树的高度最大差别为一,所以它也被称为高度平衡树。查找、插入和删除在平均和最坏情况下都是O(log n)。增加和删除可能需要通过一次或多次树旋转来重新平衡这个树-let s go
doubleList
- 双链表由于双链表的对称性,在双链表能能方便地完成各种插入、删除操作。 -let s go
calculate
- 实现加,减,乘,除计算,输入的数字不符合要求会转到错误的页面-Implementation of addition, subtraction, multiplication, division calculation, enter the numbers do not meet the requirements will go to the wrong page
like
- like GO SHOPPING gamespot
fangzhendianti
- 模拟某校九层教学楼的电梯系统。该楼有一个自动电梯,能在每层停留。九个楼层由下至上依次称为地下层、第一层、第二层、……第八层,其中第一层是大楼的进出层,即是电梯的“本垒层”,电梯“空闲”时,将来到该层候命。 乘客可随机地进出于任何层。对每个人来说,他有一个能容忍的最长等待时间,一旦等候电梯时间过长,他将放弃。 模拟时钟从0开始,时间单位为0.1秒。人和电梯的各种动作均要消耗一定的时间单位(简记为t),比如:有人进出时,电梯每隔40t测试一次,若无人进出,则关门;关门和开门各需要20t;每个
osBank
- 3、银行家算法 设request:是Pi进程的请求向量,当Pi发了资源请求后,系统按下述步骤检查: (1)如果Request[i]<= Need[i],则转向步骤(2); (2)若Request[i] <=Available,则转向步骤(3); (3)系统试探性地把要求的资源分配给进程Pi,并修改以下数据结构的值: Available=Available-Request[i]; Allocation[i]= Allocation[i]+ Request[i];
qishizouri
- 数据结构作业,利用队列实现骑士走日算法,计算出在方格内能否在一定步数之内达到目的地-Data structure operations, the use of the queue to go on to achieve knight algorithm to calculate whether the box within a certain number of steps to reach the destination
joseph
- 约瑟夫问题如下:已知n个人(n>=1)围坐一圆桌周围,从1开始顺序编号。从序号为1的人开始报数,顺时针数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规则重复下去,直到所有人全部出列。请问最后一个出列的人的编号。 -Joseph questions are as follows: Given n individuals (n> = 1) sitting around a round table, numbered sequentially startin
jiayou
- 假定你开去香格里拉。出发前油箱是满的,可以行驶D公里。路上一共有n个加油站,A[i]表示从第i-1加油站到第i个的距离。最后一个加油站在香格里拉。请设计算法帮助驾驶员选择加油站使加油的次数最少-Suppose you go through Shangri-La. Tank is full before departure, can travel D km. On the road a total of n stations, A [i] that from the first i-1 i-sta
shujuqingxihao
- 数据清洗,出去不需要的数据,简单好用,希望喜欢-Data cleansing, data do not need to go out, easy to use, I hope like
Kernel-Adaptive-Filtering
- This book presents a comprehensive and unifying introduction to kernel adaptive fi ltering. Adaptive signal processing theory has been built on three pillars: the linear model, the mean square cost, and the adaptive least - square learning algo
rescue
- rescue 孤岛营救问题 大兵瑞恩被关押在迷宫的东南角,即(N,M)单元里,并已经昏迷。迷宫只有一个入口, 在西北角。也就是说,麦克可以直接进入(1,1)单元。另外,麦克从一个单元移动到另一个 相邻单元的时间为1,拿取所在单元的钥匙的时间以及用钥匙开门的时间可忽略不计。-island to rescue Private Ryan, rescue issues to be held in the southeast corner of the maze, namely (N, M)
gobackn
- Go-Back-N ARQ is a specific instance of the automatic repeat request (ARQ) protocol, in which the sending process continues to send a number of frames specified by a window size even without receiving an acknowledgement (ACK) packet from the receiver
Link-a-System-Level-OFDM-Simulator
- 针对OFDM系统,分成链路级仿真和系统级仿真两个部分。为了降低系统级仿真的复杂度,采用链路级仿真的部分结果。-It contains mainly two parts, i.e. link-level simulator and system-level simulator. Link-level simulator focus on a single-cell single-user scenario, where signal is transmitted from tx, and
elevator-simulation
- 电梯模拟,模拟某校九层教学楼的电梯系统。该楼有一个自动电梯,能在每层停留。九个楼层由下至上依次称为地下层、第一层、第二层、……第八层,其中第一层是大楼的进出层,即是电梯的“本垒层”,电梯“空闲”时,将来到该层候命。 乘客可随机地进出于任何层。对每个人来说,他有一个能容忍的最长等待时间,一旦等候电梯时间过长,他将放弃。 模拟时钟从0开始,时间单位为0.1秒。人和电梯的各种动作均要消耗一定的时间单位(简记为t),比如:有人进出时,电梯每隔40t测试一次,若无人进出,则关门;关门和开门各需要2
go
- 表达式求值,可根据输入表达式求解结果,并审查表达式是否正确-Expression evaluation, the results can be solved according to the input expression, and to examine the expression is correct
FreeUPX
- 加壳工具,加壳的全称应该是可执行程序资源压缩,是保护文件的常用手段。 加壳过的程序可以直接运行,但是不能查看源代码.要经过脱壳才可以查看源代码。-Packers tools, packed full name of the executable program resources should be compressed, the file is a common means of protection. Packers can be run directly through the progr