Insertion Sort In Java

In this example we are going to sort integer values of an array using insertion sort.

Insertion Sort In Java



In this example we are going to sort integer values of an array using insertion sort.

Insertion sorting algorithm is similar to bubble sort. But insertion sort is more  efficient than bubble sort because in insertion sort the elements comparisons are less as compare to bubble sort. In insertion sorting algorithm compare the value until  all the prior elements are lesser than compared value is not found. This mean that the all previous values are lesser than compared value. This algorithm is more efficient than the bubble sort .Insertion sort is a good choice for small values and for nearly-sorted values. There are more efficient algorithms such as quick sort, heap sort, or merge sort for large values .

Positive feature of insertion sorting: 

1.It is simple to implement 
2.It is efficient on (quite) small data values 
3.It is efficient on data sets which are already nearly sorted.

The complexity of insertion sorting is O(n) at best case of an already sorted array and  O(n2) at worst case .


Code description:

In insertion sorting take the element form left assign value into a variable. Then compare the  value with  previous values. Put  value so that values must be lesser than the previous values. Then assign  next  value to a variable and follow the same steps relatively until the comparison not reached to end of array.  

Working of insertion sorting:

The code of the program :

public class InsertionSort{
  public static void main(String a[]){
  int i;
  int array[] {12,9,4,99,120,1,3,10};
  System.out.println("\n\n RoseIndia\n\n");
  System.out.println(" Selection Sort\n\n")
  System.out.println("Values Before the sort:\n");  
  for(i = 0; i < array.length; i++)
  System.out.printarray[i]+"  ");
  insertion_srt(array, array.length);  
  System.out.print("Values after the sort:\n");  
  for(i = 0; i <array.length; i++)
  System.out.print(array[i]+"  ");

  public static void insertion_srt(int array[]int n){
  for (int i = 1; i < n; i++){
  int j = i;
  int B = array[i];
  while ((j > 0&& (array[j-1> B)){
  array[j= array[j-1];
  array[j= B;

Output of the example:

C:\array\sorting>java InsertionSort
       Selection Sort
Values Before the sort:
12  9  4  99  120  1  3  10
Values after the sort:
1  3  4  9  10  12  99  120

Download this example.

Share on Google+Share on Google+

Insertion Sort In Java

Posted on: May 28, 2007 If you enjoyed this post then why not add us on Google+? Add us to your Circles



Discuss: Insertion Sort In Java   View All Comments

Post your Comment

Your Name (*) :
Your Email :
Subject (*):
Your Comment (*):
  Reload Image
June 27, 2012
This Code

I don't know who wrote the above code, but its pretty bad. I've been programming java for only 2 years and have fixed this code up. why does insertion_srt() need a parameter for the length of the array? the method can just use array.length. I dont normally comment on things like this, but this code was soo bad i had to. please fix it up so future users are not confused by the useless complexity of the code
August 15, 2012
selection sort

write a driver class to contain the following 1.method to input 10 numbers 2.sort the 10 numbers in ascending order. 3.display the sorted numbers
August 21, 2012

The way of illustrating is good ....PLz could you suggest more about java languages to
December 7, 2012

you did your swap wrong. use a temp variable to move value of array[j] to array[j-1]
December 8, 2012

The code and output says 'Selection Sort' though the program is for 'Insertion Sort'. Thanks for this article, really helped me learning this messed-up sorting.
Alexander Baggett
December 12, 2012

What does n represent in this example?
Mukul Kantiwal
November 12, 2012
Java programs

I need a program for insertion sort
September 19, 2013

is this logic ok with strings?
December 24, 2013
data structure and algorithm

go a head...1