-
NovatelRange
上传程序用于解析Novatel输出range 信息,解析结果已经验证。(The upload process is used to resolve the Novatel output range information, analytical results have been verified.)
- 2013-05-17 16:24:27下载
- 积分:1
-
medo
设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组,每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。 编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n(n<=200),表示每个数组有n个数。接下来的两行分别是X,Y数组的元素。结果输出 程序运行结束时,将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits. programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
- 2021-03-22 16:29:16下载
- 积分:1
-
ccode
包括汉诺塔、杨辉三角、求根值等c程序,在VC++6.0运行没问题。(Including the Tower of Hanoi, Yang Hui triangle, the value of such c rooting process running in VC++6.0 no problem.)
- 2010-12-15 08:41:27下载
- 积分:1
-
CProgram.rar
说明: 实现了很多的数据结构算法,适合与想学习数据结构编程的读者。(achieve a lot of data structure algorithms, fit and want to learn data structure programming readers.)
- 2006-04-05 16:52:57下载
- 积分:1
-
Camera_EXG50_GigE
Initialise and acquisition of Camera EXG50 GigE
- 2011-12-20 17:32:53下载
- 积分:1
-
Hufferman
使用哈弗曼编码技术进行数据压缩和解压缩,缺点在于只能用于文本(Havermann coding techniques using data compression and decompression, disadvantage is that the text can only be used)
- 2010-01-03 19:23:10下载
- 积分:1
-
control2
这是一个在控制面板中增加自己软件所需配置属性的源程序。(This is an increase in the control panel software required for their configuration properties of the source.)
- 2013-07-01 20:28:56下载
- 积分:1
-
Desktop
调度问题的回溯算法,算法中的经典问题。问题描述:假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度,使得完成全部任务的时间最早。(Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.)
- 2010-02-19 23:31:11下载
- 积分:1
-
shiper
Воронежский гос университет, задача по сям
- 2009-10-11 01:30:49下载
- 积分:1
-
aPLib-1.01
this is the library to compress and decompress any file. I found it on Net
- 2010-09-10 19:25:46下载
- 积分:1