搜索资源列表
RANDOMS
- 随机数生成源代码，提供C++类和注释与一个测试例子。-random number generator source code for C and Notes with a test case.
finish01
- 一般来说用int型变量超过2^31的数就会溢出。此程序是利用数组对长度很长的整形字符串进行加减操作，并且进行自动测试的例子-int type generally used more than two variables ^ 31 a few will overflow. This procedure is the use of an array of very long length of plastic strings Modified operation, as well as automa
duopidao
- 模拟多批道处理程序C# 操作系统课程设计，这个把握不大，没有好的测试例子。自己看吧。 转载请注明出自www.shootsoft.net-simulated multiple processing Road # C courses on operating system design, not grasp this, there is no good test case. Ion battery. Please specify reproduced from www.shoot
1050MovingTtables
- HDOJ ACM input:The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Ea
数组按从小到大的顺序排序
- 这是一个简单的排序。给你一个有N个值的数组，每个数都小于10000000。然后就将这个数组按从小到大的顺序排序。在输入时，第一行输入一个整数T，T代表一个有多少个数组要排序。然后就有T组数，每组数的第一行就是数组的大小N。紧跟着就有N行数，第N行就是数组的第N个数。每个数组的输出就有N行。,Given you an array with N non-negative integers which are smaller than 10,000,000, you have to sort this
NODE_IEEE30
- 电力系统标准测试系统，30节点系统，格式完全正确，可以方便的用来分析计算。-Power system standard test system, 30-bus system, the format entirely correctly, can easily be used to analyze the calculation.
Realize-UKF-with-Matlab
- 详细的介绍了UKF算法在matlab中的实现过程，并有matlab测试例子，适合UKF初学者-Described in detail in the UKF algorithm in matlab implementation process, and matlab test case for beginners UKF
find_the_marble
- 利用动态规划算法解决猜测弹珠位置的问题Alice and Bob are playing a game. This game is played with several identical pots and one marble.-Alice and Bob are playing a game. This game is played with several identical pots and one marble. When the game starts, Alice puts th
HanoiTowerSequence
- 题目大意： 经典的汉诺塔 n个盘编号，从小到大 1..n 问：移动的序列中第k步移的是哪个盘 -Input The first line of the input file is T, the number of test cases. Each test case contains one integer p (1<=p<10^100). Output Output the pth e
p2G19
- 数据结构实现QUEUE的原代码，配合文档及TEST CASE说明-C source code for building the queue
11.txt
- It consider spectrum estimation, using Marple s test case
scheduling
- 用于车间调动的自适应遗传算法，高效，带有Benchmark测试案例-Workshop for the mobilization of the adaptive genetic algorithm, high efficiency, with a Benchmark Test Case
123
- 黑盒测试的测试用例设计，很好的测试用例，很基础，能看懂，有效果-Black box testing the test case design, a good test case, it is based, can read and understand, there are effects
2
- 二叉排序树的创建与使用 (时间限制为：1000毫秒) 描述： 二叉排序树的定义是：或者是一棵空树，或者是具有下列性质的二叉树：（1）若它的左子树不空，则左子树上所有的结点值均小于它的根结点的值；（2）若它的右子树不空，则右子树上所有结点的值均大于或等于它的根结点的值；（3）它的左右子树也分别为二叉排序树。现要求根据输入的元素值，构造一棵二叉排序树，并输出其先序遍历、中序遍历和后序遍历结果。 输入： 输入第一行为测试用例个数n，接下来为n个测试用例，每个测试用例占两
knn
- kNN算法c++实现及算法简介 附测试用例 附说明ppt-kNN algorithm and the algorithm c++ Implementation Note About attached test case attached ppt
LMS_RLS_sim
- 功能描述：测试LMS与RLS算法，比较两种算法的收敛特性 文件名：LMS_RLS_sim.m 测试用例： x(n)+a1*x(n-1)+a2*x(n-2)=e(n)，a1=-1.6,a2=0.81,e(n)为高斯白噪声 文件输出：系数a1的值 调用函数：function [A] = LMS_Algo(M,N,mu,xn) 被调用：无 作者：mingcheng 编写时间：2009-10-13 修改时间：2009-10-13
L_D_sim
- 功能描述：测试Levinson-Durbin算法 文件名：L_D_sim.m 测试用例： (1)x(n)+0.81*x(n-2)=u(n)，u(n)为高斯白噪声 (2)x(n)=u(n)+u(n-1)+u(n-2),u(n)为高斯白噪声 文件输出：两种测试用例情况下的功率谱 调用函数：function [A,E] = Levinson_Durbin_Algo(R,P) 被调用：无 作者：mingcheng 编写时间：2009-11
sortings
- 基本排序算法，数据结构采用线性表。包括归并排序、希尔排序、快速排序、直接插入排序、选择排序、冒泡排序。有测试用例。-Basic sorting algorithms, data structures, linear form. Including the merge sort, Hill sort, quick sort, direct insertion sort, selection sort, bubble sort. A test case.
FFT
- FFT的C语言程序，包括失真度函数，最后加入了一个测试例子-FFT of the C language program, including the distortion function, and finally added a test case
test
- 先输入计算次数，然后输入数组个数，最后输出的是排好序的最小数组-Descr iption Dr lee cuts a string S into N pieces,s[1],…,s[N]. Now, Dr lee gives you these N sub-strings: s[1],…s[N]. There might be several possibilities that the string S could be. For example, if Dr. le