S4 - dsa lab - INSERTION SORT

                                 

                                         INSERTION SORT

import java.io.*;

class Sort

{

DataInputStream ss=new DataInputStream(System.in);

int a[],i,j,l;

void read()

{

try

{

System.out.println("Enter the limit  :   ");

l=Integer.parseInt(ss.readLine());

a=new int[l];

System.out.println("Enter the elements     :");

for(i=0;i<l;i++)

a[i]=Integer.parseInt(ss.readLine());

}

catch(Exception e)

{}

}

void sort()

{

for(i=2;i<l;i++)

{

int key=a[i];

j=i-1;

while(a[j]>key)

{

a[j+1]=a[j];

j--;

a[j+1]=key;

}

}

System.out.println("Sorted element  :  ");

for(i=0;i<l;i++)

{

System.out.println(" "+a[i]);

}

}

}

class isort

{

public static void main(String args[])

{

Sort obj=new Sort();

a.read();

a.sort();

}

}

OUTPUT

Enter the limit  :

5

Enter the elements     :

1          5        3        2        4

Sorted elements  :

1          2        3        4        5