-
Monkeys-and-peach
Monkeys and peach,Monkeys and peach(Monkeys and peach)
- 2013-09-01 22:06:42下载
- 积分:1
-
Large_integer_multiplication
算法分析与设计——大整数乘法。
计算两个超出机器数表示范围的整数的乘积。(Algorithm Analysis and Design- large integer multiplication. Calculating the number of two machines that go beyond the scope of the product of an integer.)
- 2009-05-08 14:21:06下载
- 积分:1
-
josephus
说明: 约瑟夫算法,适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)
- 2011-04-13 16:43:47下载
- 积分:1
-
BiTree
二叉排序树的建立、插入与删除。按递增顺序插入N个整数,并按同样顺序删除;(Binary sort tree establishment, insertions and deletions. Insert N integers in ascending order, press the same sequence deleted )
- 2020-09-05 16:38:05下载
- 积分:1
-
work_std
工作时单元功能实现的部分资料
主要涉及字符串处理、排序算法,字符串查询、kmp、改进二分法、Unicode编码、uniq(functional modules work to achieve some of the information involved mainly string handling, sorting algorithm, string inquiries, kmp improve dichotomy, Unicode encoding, uniq)
- 2007-01-23 08:57:38下载
- 积分:1
-
c++
一款可以排序的小程序,希望大家可以看一下(A sort of small program, I hope you can look at it)
- 2017-12-13 20:06:55下载
- 积分:1
-
Online_RandMarkingAlgorithm
本程序解决的是:模拟类似计算机主、缓存的存储结构,当用户请求某个页面时,若某个页面已在缓存中,则直接从缓存中去取,不会产生失误(即未在缓存中命中),否则,就到主存中去取,代价变大。
本程序采用随机标记算法,即在在线标记算法的基础上,对于替换页面时,采用随机从未标记的缓存项中选出一项进行替换。
代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)
- 2012-09-19 13:01:47下载
- 积分:1
-
arrangement
假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。)
对于给定的k 个待安排的活动,编程计算使用最少会场的时间表。
(Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.)
K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
- 2014-10-22 11:00:45下载
- 积分:1
-
huffman
数据结构(严蔚敏版)中哈夫曼树的操作程序源代码(Of data structure (Yan Wei Min version) operating procedures in the source code Huffman tree)
- 2010-05-24 23:19:39下载
- 积分:1
-
插入排序
说明: 根据所选定的字符顺序,按照从大到小的规则,对字符进行插入排序,(Insert and sort characters)
- 2020-06-22 12:40:01下载
- 积分:1