I can’t remember the question exactly, but it required removing the smallest and largest elements and appending their sum to the end of a list. Then there would be a cost function tracking the process of doing that removing and appending process repeatedly. It was fastest, I believe, to sort the list first using a mergesort because the solution would otherwise have to be in O(n^2) to trace the code the way shown in the example.