From python docs.
I have found the algorithm in quite a few places such as here, here and here. None of them have mentioned the name of the algorithm.
I need to give a reference for a paper so please point me in the right direction.
From python docs.
I have found the algorithm in quite a few places such as here, here and here. None of them have mentioned the name of the algorithm.
I need to give a reference for a paper so please point me in the right direction.
This is known as "Multiway merging" and is described by Donald Knuth in The Art of Computer Programming, Volume III - Sorting and Searching, section 5.4.1.
If you understand merging of sorted lists then that is what this function is basically doing. There is no name for it, other than merging.
As an aside, merge-sort uses a similar routine, generally on two sorted lists. It is why it's called 'merge'-sort.