Skip to content

Latest commit

 

History

History
 
 

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 

README.md

Merge Sort

This program inputs an array and uses the Divide and Conquer strategy to sort it

Input Format

  • The input consisits of 2*T + 1 lines
  • The first line of input contains T test case
  • The first line contains N (size of array)
  • The second line in testcase contains N space seperated integers (elements of array)

Output Format

A single line which shows a sorted array.

Sample Input

2
5
2 4 1 55 23
4
99 4 11 32

Sample Output

1 2 4 23 55
4 11 32 99

Implemented in: