29 lines (15 loc) · 467 Bytes

Problem

Implementing Merge algorithm to sort an integer array in ascending order, and try to make it as fast as possible.

Input Format

First line:the size of the array Second line:the array to be sorted(numbers seperated by spaces)

Constraints

N <= 1000

Output Format

output between two brackets and each number seperated by a coma.

Sample Input

6

1 9 3 5 4 7

Sample Output

[1,3,4,5,7,9]

Explanation

sort array in an ascending order.