access kth element in constant time. This is a divide and conquer algorithm that can find a solution in O(n) time. # pick a pivot and separate into list based on pivot.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results