How To Grailsort: The Definitive Guide

How To Grailsort: The Definitive Guide is a place to understand the Block Merge Sort Grailsort!

Notice: Musiccombo helped me understand this cause I didn't know anything about it previously

= Chapter 1: Improving Merge Sort = This is Merge Sort. >

It is a pretty useful sort, being $$O(n \log n)$$ worst case time and stable. Probably the only thing that's stopping it from taking over the world with its usefulness is it's space complexity. $$O(n)$$ space complexity!

Remember this figure, our main focus will be reducing it to $$O(1)$$, while retaining Merge Sort's other properties. now, how do we go about doing this? If an algorithm uses $$O(1)$$ memory, we call it In-Place.