Ángel
@angel@triptico.com
Mergesort takes the input list and treats it as a collection of small sorted lists. It makes log N passes along the list, and in each pass it combines each adjacent pair of small sorted lists into one larger sorted list. When a pass only needs to do this once, the whole output list must be sorted.https://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html