WikiSort
WikiSort copied to clipboard
BonzaiThePenguin
Fast and stable sort algorithm that uses O(1) memory. Public domain.
The line that says `Rotate(array, Range_length(range) - count, range, cache, cache_size);` calls into `memmove(&array[range2.end - Range_length(range1)], &array[range1.start], Range_length(range1) * sizeof(array[0]));` with a range where the end is less than the...
Hello, Bonzai! I've been quite interested in Wikisort and Block (Merge) Sort in general for a while now. Back in AP Comp Sci, you could say I was a bit...
Thank you for publishing your work on this algorithm. It is very fascinating. I am reading Chapter 1. I would just like to get some clarification about the reverse method....
The merge operation that is currently in place needs to be redone with a more intelligent algorithm, since it has an O(n^2) worst case. Right now I'm looking at a...
This has been bothering me for a while, but the Java version is nowhere near the performance of a standard merge sort. I spent most of yesterday removing all class...
Metadata
Owner
Metadata
Fast and stable sort algorithm that uses O(1) memory. Public domain.