搜索资源列表
!select
- 顺序统计select算法。从s个元素中找出第k个大的元素。- The order counts the select algorithm. Discovers the kth big element from s element.
KShortestPath
- kth算法的实现，可找出第k次最短路径，给出优化方案
ksp
- 求前k条最短路径,本程序可用于求地图的路线安排和前k个最短路径分配问题，十分管用，可用于2000个点的计算-find out the kth shortest path
kth_smallest
- Kth Largest element in an array in time O(n) without sorting the entire array.
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
Kth_number
- 划分树求区间K小数的Pascal源代码, 其建树复杂度为O（nlogn）, 回答询问为O（logn)-A kind of tree to answer the kth smallest number in an interval.
kth_median
- Kth Median efficient algorithm implementation in C.
AVLTree
- AVLTree basic operation: Insert, delete, kth min
objectdet
- Viola Jones 的目标检测程序，虽然人脸检测已经发展了近十年，但是还有不少学者研究人脸检测。此程序是通过邮件从KTH皇家技术学院的Vahid Kazemi要到的。特意共享出来。-Viola Jones Object Detector ，which can finish adaboost face detection
1_1
- 输出N个数中的第K个最大数,或者说是第K个大的数-Output the Kth max number of n
Modeling-Rayleigh-fading-channel-based-on-modifie
- This Matlab Code models a Rayleigh fading channel using a modified Jakes channel model. A modified Jakes model chooses slightly different spacings for the scatterers and scales their waveforms using Walsh–Hadamard sequences to ensure zero cross-co
RB_Tree_danciking
- 使用红黑树编写“背单词”应用，根据熟悉度进行排序，熟悉度相同根据字典序排序。可添加，删除单词，也可以修改单词的熟悉度。可查找第k个单词，或计算kth到lth的单词熟悉度综合。-Use red-black tree to write " back the word" application, based on familiarity sort of familiarity same lexicographically sorted. You can add, delete wor