Closed EmeraldBlock closed 3 years ago
It's like regular merge sort, but the array is split by parity (ex. A B C D is split into A C and B D instead of A B and C D). Comes with the advantage that it could potentially easily be done iteratively (this one uses recursion).
A B C D
A C
B D
A B
C D
Cache-friendliness? Who cares about that?
Math rules, cache drools (Control’s role)
It's like regular merge sort, but the array is split by parity (ex.
A B C D
is split intoA C
andB D
instead ofA B
andC D
). Comes with the advantage that it could potentially easily be done iteratively (this one uses recursion).Cache-friendliness? Who cares about that?