27/07/2011

Insertion Sort

In JAVA
class insertion
{
public static int[] main(int a[])
{
int i,j,key,n;
n=a.length;
for(j=1;j=0 &&a[i]>key)
{
a[i+1]=a[i];
i=i-1;
}
a[i+1]=key;
}
return a;
}
}
//*Note that we are starting for loop from 1 because array indices start from 0

No comments:

Post a Comment