Merge Sort Bugs

The Classic Merge Sort Bug

A bug that occurs when the programmer forgets that arrays in C are 0-indexed, causing the whole sort to go haywire.

Learn more
The Inefficient Merge Sort Bug

A bug that causes the sort to take an exponential amount of time to run due to an O(n^2) merge step.

Learn more
The Unstable Merge Sort Bug

A bug that causes the sort to be unstable, resulting in a random and unpredictable outcome.

Learn more