搜索资源列表
Ksmall
- VC++编译的“第K小的元素问题”-VC compiler's "K small elements" ...
fenzhifa.rar
- 分治法的基本思想，掌握递归程序编写方法；使用分治法编程，求解线形序列中第k小元素。,Separation of the basic ideas, grasp the recursive programming methods the use of sub-rule law programming, solving linear sequence of the first k small element.
第K小元素
- 这是算法分析与设计一书中的其中一个算法,求第K小元素的源程序,绝对是自己编的,不可能有重复-This is the algorithm analysis and design of a book in which an algorithm, for the first K small element of the source is definitely its own series, it is impossible to repeat
Merge
- 对于任意给定的n个元素的数组，要求从中找出第k小的元素,试用分治思想求解该问题。 -For any given n-element array of demands to find out the first k elements of a small, try thinking of sub-rule to solve the problem.
choose
- 线性时间选择查找第K小元素的C++算法，数字从txt文件中输入，结果输出到txt文件中.-Linear time selection to find the first K elements of the C++ small algorithm, digital input from a txt file, output to txt file.
1
- 用分治法求第k小元素 输入：程序从标准输入读入数据，第一行是一个整数n (1=<n<=100000)表示元素的个数，接下来的n行中每行有一个整数。最后一行是k，就是我们要找的第k小元素。 -Method used divide and conquer a small element of k-input: program read from standard input data, the first line is an integer n (1 = <n<
Kx
- 给定线性序集中n个元素和一个整数k，1<=k<=n,要求找出这n个元素中的第k小的元素，-Given the linear sequence on N elements and an integer k, 1<=k<=n, asked to identify the N element of the K element,
zuoye7
- 第k小元素（分治法） 给定一个线性序列集，要求求出其中指定的第K小的数的值和位置.如给定n个元素和一个整数i，1≤i≤n，输出这n个元素中第i小元素的值及其位置；-First k small element (divide and conquer) Given a set of linear sequence, where the specified requirements determined the K value and the small number of locations, s