What is the fastest way to find Nth biggest number of an INT array?

Randomized quickselect algorithm works in average case complexity O(n). Practically it’s very rare to be O(n^2). It uses quicksort’s partition function