Works very similarly to Grailsort; fairly straightforward and overall efficient design. Notice the somewhat odd recursion at the beginning of each run which sorts the first O(sqrt n) items -- the external buffer area -- in the array. Has the same significant bottleneck that Grailsort does: the scrolling buffer having to move back to the beginning of the array for every merge during the latter half of sorting, which I tend to call "buffer resets".
Works very similarly to Grailsort; fairly straightforward and overall efficient design. Notice the somewhat odd recursion at the beginning of each run which sorts the first
O(sqrt n)items -- the external buffer area -- in the array. Has the same significant bottleneck that Grailsort does: the scrolling buffer having to move back to the beginning of the array for every merge during the latter half of sorting, which I tend to call "buffer resets".