How to implement insertion sort in Java

1 Answer

0 votes
public class MyClass {
    static void insertion_sort(int[] arr) {  
        int len = arr.length;        
       
        for (int i = 1; i < len; i++) {            
           int val = arr[i];            
           int j = i - 1;            
           while (j >= 0 && arr[j] > val) {                
               arr[j + 1] = arr[j];                
               j--;           
           }            
           arr[j + 1] = val;
        }
    }
    public static void main(String args[]) {
        int arr[] = {2, 141, 3, 4, 21, 13, 30, 50};
        
        insertion_sort(arr);
        
        for (int i = 0; i < arr.length; i++) {                          
            System.out.print(arr[i] + " "); 
        }
    }
}
 
 
/*
run:
 
2 3 4 13 21 30 50 141 
 
*/

 



answered Jun 1, 2019 by avibootz
edited Feb 23, 2024 by avibootz

Related questions

2 answers 171 views
1 answer 137 views
137 views asked Feb 23, 2024 by avibootz
1 answer 211 views
211 views asked Sep 14, 2014 by avibootz
1 answer 187 views
1 answer 148 views
148 views asked May 31, 2019 by avibootz
2 answers 575 views
575 views asked May 13, 2018 by avibootz
...