Insert element in a sorted array O(n) Time Complexity and O(1) of Space
static void insertMe(int a[], int n){
        int holder=0;
        boolean b = true;
        for(int i=0; i<a.length; i++){
            if(a[i]>n&&b){
                holder = a[i];
                a[i]=n;
                b=false;
            }
            else if(!b){
                int temp = holder;
                holder = a[i];
                a[i]=temp;
            }
        }
        
        for(int i: a){
            System.out.println(i);
        }
    }
Comments (0)