I thought that since the purely recursive implementation of mergesort| bruceediger.com
My recursive| bruceediger.com
I’ve benchmarked mergesort variants with randomly-chosen data values, initial data values already sorted, and initial data values sorted in descending order. What happens to mergesort algorithms when initial data values are chosen for worst case time complexity?| Information Camouflage
There’s one more item I discovered during my mergesort investigation| bruceediger.com