Insertion Sort in Java

belongs to collection: Java Searching and Sorting Programs

robaa

Save to bookmark

2022-11-12

214

We can create a java program to sort array elements using insertion sort. Insertion is good for small elements only because it requires more time for sorting large number of elements.

Java programming, examples, Java programming examples,

All Answers

robaa

2022-11-12

need an explanation for this answer? contact us directly to get an explanation for this answer

public class InsertionSortExample {  
    public static void insertionSort(int array[]) {  
        int n = array.length;  
        for (int j = 1; j < n; j++) {  
            int key = array[j];  
            int i = j-1;  
            while ( (i > -1) && ( array [i] > key ) ) {  
                array [i+1] = array [i];  
                i--;  
            }  
            array[i+1] = key;  
        }  
    }  
       
    public static void main(String a[]){    
        int[] arr1 = {9,14,3,2,43,11,58,22};    
        System.out.println("Before Insertion Sort");    
        for(int i:arr1){    
            System.out.print(i+" ");    
        }    
        System.out.println();    
            
        insertionSort(arr1);//sorting array using insertion sort    
           
        System.out.println("After Insertion Sort");    
        for(int i:arr1){    
            System.out.print(i+" ");    
        }    
    }    
}

Output:

Before Insertion Sort
9 14 3 2 43 11 58 22 
After Insertion Sort
2 3 9 11 14 22 43 58

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

<< Selection Sort in Java...

Insertion Sort in Java

All Answers

Java Searching and Sorting Programs

This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now