kth smallest element# JobHunting - 待字闺中
l*h
1 楼
老题了,还是不知道怎么找?
Find kth smallest element from an unsorted array in linear time. worst case
complexity should be O(n+k)
where n is array size.
Find kth smallest element from an unsorted array in linear time. worst case
complexity should be O(n+k)
where n is array size.