Insertionsort.java

import java.util.*;
public class Insertionsort {
    public static void main(String[] args)
    {
        Scanner s = new Scanner(System.in);
        System.out.println("Enter the value of n: ");
        int n=s.nextInt();
        int[] arr = new int[n];
        System.out.println("Enter value into the array: ");
        for(int i=0;i<n;i++)
        {
            arr[i]=s.nextInt();
        }
 
          // time complexity=O(n^2)
 
        for(int i=0;i<n-1;i++)
        {
            int smallest=i;
            for(int j=i+1;j<n;j++)
            {
                if(arr[smallest] > arr[j])
                {
                    smallest=j;
                }
            }
            int temp= arr[smallest];
            arr[smallest] = arr[i];
            arr[i]=temp;

        }
        for(int i=0;i<n;i++)
        {
            System.out.println(arr[i]);
        }

    }
    
}