What is the quickest method for determining the Nth largest integer in an array of integers?

edit

One possible method is to sort the array in descending order and then return the element at the Nth position. This can be done quickly using a sorting algorithm such as quicksort or mergesort, which have an average time complexity of O(n log n). Alternatively, one could use a linear-time selection algorithm such as quickselect or heap-select, which have a worst-case time complexity of O(n) but may require more complex code to implement.