InsertionSort.java

// Insertion Sort

// Provided with a random integer array/list(ARR) of size N, you have been required to sort this array using 'Insertion Sort'.
// Note:
// Change in the input array/list itself. You don't need to return or print the elements.
// Input format :
// The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.

// First line of each test case or query contains an integer 'N' representing the size of the array/list.

// Second line contains 'N' single space separated integers representing the elements in the array/list.
// Output Format :
// For each test case, print the elements of the array/list in sorted order separated by a single space.

// Output for every test case will be printed in a separate line.
// Constraints :
// 1 <= t <= 10^2
// 0 <= N <= 10^3
// Time Limit: 1 sec
// Sample Input 1:
// 1
// 7
// 2 13 4 1 3 6 28
// Sample Output 1:
// 1 2 3 4 6 13 28
// Sample Input 2:
// 2
// 5
// 9 3 6 2 0
// 4
// 4 3 2 1
// Sample Output 2:
// 0 2 3 6 9
// 1 2 3 4 




packageArray;
importjava.util.Scanner;
publicclassInsertionSort {


publicstaticint[] takeInput() {
Scannersc = newScanner(System.in);
System.out.println("Enter the length of the array: ");
intn = sc.nextInt();
int [] arr = newint[n];
System.out.println("Enter the elements of the array: ");
for (inti = 0; i < n; i++) {
arr[i] = sc.nextInt();
 }
returnarr;
 }

publicstaticvoidInsertionSort(int [] arr) {
intn = arr.length;
for (inti = 1; i < n; i++) {
inttemp = arr[i];
intj = i - 1;
while ( j >= 0 && arr[j] > temp) {
arr[j + 1] = arr[j];
j--;
 }
arr[j + 1] = temp;

 }
 }


publicstaticvoidprintArray(int [] arr) {
System.out.println("The sorted array is: ");
intn = arr.length;
for (inti = 0; i < n; i++) {
System.out.print(arr[i] + " ");
 }
 }

publicstaticvoidmain(String[] args) {
int [] arr = takeInput();
InsertionSort(arr);
printArray(arr);

 }
}