Import Java.util.Scanner;
public class insertsort{
public static void Directsort (double n[]) {//Direct insert sort from elements starting with array subscript 1
int i,j;
for (i=2;i<n.length;i++) {
N[0]=n[i];
For (j=i-1;j>0 && n[j]>n[0];j--) {
N[J+1]=N[J];
}
N[J+1]=N[0];
}
}
public static void Showsort (double[] num) {
System.out.println ("sorted:");
for (int i=1;i<num.length;i++) {
System.out.print (Num[i] + "");
}
}
public static void Main (String args[]) {
Double[] num={0};
Scanner in=new Scanner (system.in);
Double Newnumber;
System.out.println ("Enter 0 represents stop");
System.out.println ("Please enter the proper numbers");
while (true) {
Newnumber=in.nextdouble ();
if (newnumber==0f) {
System.out.println ("User Stop the Sort");
Break
}
Double[] tmp=new double[num.length+1];//Temporary array
System.arraycopy (num,0,tmp,0,num.length);//copy array
Tmp[num.length]=newnumber;
num=tmp;
Directsort (num);
Showsort (num);
}
}
}
Direct Insert Sort