This problem is designed to test your implementation of an n log n sort.
Given n numbers, sort them.
PS, bubble/insertion/selection sort are NOT fast enough.
Please do not use qsort, sort, or any other built-in sorting function. Submissions which use these will be
The first line of input contains a single number n
(0 ≤ n
This is followed by n
numbers which fit in a 32-bit signed integer.
Print the numbers in ascending order, one per line.
Sample Input 1
Sample Output 1