If you don’t know what Merge Sort is then read all about it here. Otherwise this programming tasks asks you to program a simple merge sort using recursion. Start by creating an array of random numbers that require sorting and pass it to your sorting method.
A good extension for this task is to use timers and compare it with Bubble Sort which is a linear sort. With larger arrays which is quicker?