Play this interactive merge sort game to check your understanding of the merge sort algorithm - there are also similar games for insertion and bubble sorts. The first stage of a merge sort is to split the items to be sorted into separate lists, each containing one value - that part is done for you.
On each row you are merging two lists (coloured red and green) into a new, bigger list (with the red border) - choose whether the next number should come from the left (red) list or the right (green) list. You will be timed to see how long you take to complete the sort, and there will be a two-second penalty for each incorrect decision.
Merge the next item from the: