Find largest and second largest element in a range

Question

How do I find the above without removing the largest element and searching again? Is there a more efficient way to do this? It does not matter if the these elements are dupl

Answer 1

Create a sublist from n..m, sort it descending. Then grab the first two elements. Delete these elements from the orginal list.