public static void insertionSort1(int n, List<Integer> arr) {
            int v = arr.get(n-1); // take last number
            int i = n-2; // get last but one index
            while(i>=0 && v < arr.get(i)) {  // continue the loop till i>=0 and value < ith value
                if(arr.get(i) > v)
                    arr.set(i+1, arr.get(i)); // if value < ith value, shift ith value to i+1 th index
                i--; // go to left
                for(int x:arr) System.out.print(x +" "); // print the array in each setp
                System.out.println();
            }
            arr.set(i+1, v); // at ent set i+th value to value selected in the begining
            for(int x:arr) System.out.print(x +" "); // print the array again
            System.out.println();
    }

public static void insertionSort1(int n, List<Integer> arr) {
        int last = arr.get(arr.size()-1);
        boolean sorted = false;
        int i = arr.size()-2;
        while(!sorted){
            if(arr.get(i) > last){
                arr.set(i+1, arr.get(i));
            }else{
                arr.set(i+1,last);
                sorted = true;
            }
            arr.stream().forEach(x -> System.out.printf("%d ", x));
            System.out.println();
            if(i==0 &&!sorted){
                arr.set(0,last);
                arr.stream().forEach(x -> System.out.printf("%d ", x));
                sorted = true;
            }
            --i;
        }
    }

function insertionSort1(n, arr) {
 const lastNum = arr[n - 1]
 
 for (let index = n - 2; index >= 0; index--){
      let current = arr[index]
      if (current > lastNum) {
            arr.splice(arr.indexOf(current)+1, 1, current)
            console.log(arr.join(' '))
      } 
      else if (current < lastNum){
            arr.splice(arr.indexOf(current)+1, 1, lastNum)
            console.log(arr.join(' '))
            break;
      }
 }
}

fn insertionSort1(n: i32, arr: &[i32]) {
    let mut vector: Vec<i32> = vec![arr[0]];
    for i in 1..n {
        vector.push(arr[i as usize]);
    }

    let mut index = (n - 1) as usize;
    let temp = arr[index];

    while index.checked_sub(1) != None 
    && vector[index - 1] > temp {
        vector[index] = arr[index - 1];
        index -= 1;
        for ele in &vector {
            print!("{} ", ele);
        }
        print!("\n");
    }

    vector[index] = temp;
    for ele in &vector {
        print!("{} ", ele);
    }
    print!("\n");
}