We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Sorting
  4. Insertion Sort - Part 2
  5. Discussions

Insertion Sort - Part 2

  • BALYAM_muralidh2
     + 1 comment
    static void insertionSort2(int n, int[] arr) {
        // Complete this function
       
     for(int k=0;k<arr.length-1;k++){
         for(int i=0;i<arr.length-1;i++){
          int key = arr[k+1];
             if(i==k+1)
                 break;           
             if(arr[i]>key){
                 arr[k+1]=arr[i];
                 arr[i]=key;
             }
         }
         for(int i=0;i<arr.length;i++)
         {
         System.out.print(arr[i]+" ");
     } 
         System.out.println();
     }
    }