Sort _ Simple Sort _ Insert Sort

The insert sort has three record values, one of which records the value that is taken out, and the value to be inserted, starting at the second position. The other two initial positions are the same, starting with the second value recording. This is characterized by an orderly array of current assumptions before each comparison.

 Public classArrayins {Private Longa[]; Private intNelems;  PublicArrayins (intmaxSize) {a=New Long[MaxSize]; Nelems=0; }    //Insert     Public voidInsertLongvalue) {A[nelems++]=value; }    //Show     Public voiddisplay () { for(intj=0;j<nelems;j++) System.out.print (A[j]+" ");    System.out.println (); }    //Sort     Public voidInsertionsort () {intOut,in;  for(out=1;out<nelems;out++) {            Longtemp=A[out]; Inch=Out ;  while(in>0&&a[in-1]>=temp) {A[in]=a[in-1]; Inch--; } A[in]=temp; }    }}

 Public classTest { Public Static voidMain (string[] args) {intmaxsize=100; Arrayins Arraybub=NewArrayins (maxSize); Arraybub.insert (77); Arraybub.insert (99); Arraybub.insert (44); Arraybub.insert (55); Arraybub.insert (22); Arraybub.insert (88); Arraybub.insert (11); Arraybub.insert (0); Arraybub.insert (66); Arraybub.insert (33);        Arraybub.display ();        Arraybub.insertionsort ();    Arraybub.display (); }}

Sort _ Simple Sort _ Insert Sort