Common sorting algorithms for Java programming

Common sorting Algorithms for Java

First type: Insert sort

Direct Insert Sort

1, direct Insert sort

(1) Basic idea: In the set of numbers to be sorted, assume that the number of front (n-1) [n>=2] is already a row

In a good order, now you want to insert the nth number into the ordinal number in front, so that the n number

It's also in the right order. This cycle is repeated until all the rows are in order.

(2) Illustration

1  Public Static voidMain (string[] args) {2         //Sort Ascending3         int[] a={9,7,8,6,5,4,3,2,1};4         intTemp=0;5          for(inti=1;i<a.length;i++){6             intJ=i-1;7temp=A[i];8              for(; j>=0&&temp<a[j];j--){9a[j+1]=A[j];Ten             } Onea[j+1]=temp; A         } -  -System.out.println ("Test2.main ()" +arrays.tostring (a)); the}

View Code