This same argument for Max and Min could be applied to this operator. The main
benefit would be performance, but I think it actually might be more readable.
Without the requirement of sorting the entire list, you move from an average
case of O(n log n)for an optimal sorting algorithm to O(n) for an optimal
selection algorithm.
Original issue reported on code.google.com by Pope...@gmail.com on 27 May 2015 at 9:49
Original issue reported on code.google.com by
Pope...@gmail.com
on 27 May 2015 at 9:49