Efficient unbalanced merge-sort

Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, the merge

• Type: Journal
• Year: 2006
• Where: ISCI
• Authors: Enrico Nardelli, Guido Proietti
• Keywords: Algorithms, ISCI 2006, Merge­sort Algorithms, Successive Merging