搜索资源列表
Ksmall
- VC++编译的“第K小的元素问题”-VC compiler's "K small elements" ...
Kmin.rar
- 求第K小元素（分治法实现） ,K for the first small element (sub-rule method)
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.
searchK
- 分治法寻找第K小元素，包含具体程序和word文档。-Sub-rule method to find the first small element of K, including the specific procedures and word documents.
第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
thekth
- 第k小元素的实现，包含四种算法 选择排序 快排 随机排序 中位数法-The first element in the realization of small k, including four fast sorting algorithm to choose a random row to sort the median method
Randomizedselect
- （C语言）用随机选择的方法查找第k小元素，它的期望运行时间是一个带有小的常系数的Θ（n）！-(C language) with the random selection method to find the first small element of k, and its expected running time is often with a small coefficient of Θ (n)!
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<
2
- 求第k小元素 输入：程序从标准输入读入数据，第一行是一个整数n (1=<n<=100000)表示元素的个数，接下来的n行中每行有一个整数。最后一行是k，就是我们要找的第k小元素。 -Find a small element of the k input: the program reads from standard input data, the first line is an integer n (1 = <n<=100000)表示元素的个数，接下来的n行中
select2
- select-二次取中求第K小元素, -find the k min number in array find the k min number in array
Sequences-into
- 给定两个不含重复元素的序列，从中任意各取一个元素求和，剔 除重复元素，构成一个新的序列（简称为和序列）。求该和序列中自 小到大的第K 个元素。-Given the sequence of two non-repeating elements from each of any one element summation, tick In addition to repeated elements constitute a new sequence (referred to as seq
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,
Select
- 选出数组中第k小元素 给定一个随机数组 用分治法-Elect the k-th smallest element in the array is given a random array of divide and conquer
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
randomizedSelect
- 线性时间选择算法，用到了随机快速排序算法中的随机划分算法。求一个数组中第k小的元素。-Linear time selection algorithm used in the random random quick sort algorithm partitioning algorithm. Find an array of small first k elements.
K-th-smallest-element
- 第k小元素，使用分治法，程序简单易懂,可以直接使用-K-th smallest element
qq.c.tar
- 用最大/最小堆实现优先队列,动态插入,查询第K小的元素,POJ black box题目解答-With a maximum/minimum heap implementation of priority queues, dynamic insertion, query a small element of the K, POJ black box subject to answer
sqhaphores
- 查找第k小元素算法的实现,很实用的一个算法程序,欢迎大家下载()