Problem of the Day
A new programming or logic puzzle every Mon-Fri

The goal of today's problem is to keep you familiar with different sorting algorithms. The input for your function will be an array of unsorted integers. Your function should then split the array in two and sort each half using a different sorting algorithm (for bonus points do this in parallel). Then after they both return you should use a third algorithm to merge the two arrays back in to one sorted array.

Comments:

• There are currently no comments. You can be first!