搜索资源列表
!select
- 顺序统计select算法。从s个元素中找出第k个大的元素。- The order counts the select algorithm. Discovers the kth big element from s element.
KShortestPath
- kth算法的实现，可找出第k次最短路径，给出优化方案
!select
- 顺序统计select算法。从s个元素中找出第k个大的元素。- The order counts the select algorithm. Discovers the kth big element from s element.
KShortestPath
- kth算法的实现，可找出第k次最短路径，给出优化方案-KTH algorithm can find the first k-shortest path is given to optimize the program
ksp
- 求前k条最短路径,本程序可用于求地图的路线安排和前k个最短路径分配问题，十分管用，可用于2000个点的计算-find out the kth shortest path
select
- In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic.) This includes the cases of finding the minimum, maximum, and med
kth_smallest
- Kth Largest element in an array in time O(n) without sorting the entire array.
DetDTMF1
- for K_ind = 1 : length(k) y = goertzel_algo ( dtmf_output,k(K_ind),Num_of_samples) if (K_ind == 1) this appends each Kth array to y1(1 : Num_of_samples) = y( 1 : Num_of_samples) the output array e
KthSmallestNumber
- 求第K个最小数的线性时间算法，采用分组分块计算，算法时间复杂度为O(n)-The algorithm of calculateing the Kth smallest number in an array
theKthNumberInASegment(segmentTree)
- 可以快速地查询某段区间的第k元素,是zoj上的Dynamic ranking 的源程序-query the kth number in a segment
land_rov
- In electrical engineering and computer science, image processing is any form of signal processing for which the input is an image, such as a photograph or video fr a me the output of image processing may be either an ima
Kth_number
- 划分树求区间K小数的Pascal源代码, 其建树复杂度为O（nlogn）, 回答询问为O（logn)-A kind of tree to answer the kth smallest number in an interval.
KSP
- dijkstra第k条最短路径算法 Dijkstra(迪杰斯特拉)算法是典型的最短路径路由算法，用于计算一个节点到其他所有节点的最短路径。-dijkstra Kth shortest path algorithm
Select-the-Kth-number-by-3-methods
- 用三种方法实现，随机生成的一堆数中选出Kth个数，包括简单选择排序、冒泡排序、快速排序-Using three methods, the number of randomly generated a bunch of selected Kth number, including the simple selection sort, bubble sort, quicksort
LMS_EQ
- In practical implementations, the weighting factors for a MRC system are obtained by deriving a signal which has amplitude proportional to the kth branch carrier amplitude and a phase that LMS equalizer
Kth-shortest-path-(1)
- 求解最优方案,以及次优方案，旨在为现实生活中的方案选择提供方便-Best plan choosing
kth_median
- Kth Median efficient algorithm implementation in C.
AVLTree
- AVLTree basic operation: Insert, delete, kth min
ECE_264_Lopez_Lab_10_Problem_2
- /*The purpose of Problem 2 was to read in characters into an array of characters, display a certain number of elements per line, to display the array from the kth element, and lastly to show how many alphabetical c
kth-min-mumbers
- 用来查询最小最小的k个数,细算法是非常有效和精准的，供参考-to search the kth number in the large numbers,it is very fast and effective