SP9722 CODESPTB - Insertion Sort

Insertion Sort is a classical sorting technique. One variant of insertion sort works as follows when sorting an array a\[1..N\] in non-descending order: ``` for i

The first line contains the number of test cases T. T test cases follow. The first line for each case contains N, the number of elements to be sorted. The next line contains N integers a\[1\],a\[2\]...,a\[N\].

Output T lines, containing the required answer for each test case.

1