学步园

 /**<br /> * 直接插入排序<br /> * @author ming<br /> *<br /> */<br /> public class InsertSort {<br /> /**<br /> * @param args<br /> */<br /> public static void main(String[] args) {<br /> int[] a = {12,3,41,23,6,9,45,23,315,19,0};</p> <p> InsertSort sort = new InsertSort();<br /> sort.Sort(a);</p> <p> for (int i = 0; i < a.length; i++) {<br /> System.out.print(a[i]);<br /> System.out.print(" ");<br /> }<br /> }</p> <p> public int Sort(int[] arr){<br /> int rst = 0;<br /> int tmp = 0 ;<br /> for (int i = 1; i < arr.length; i++) {</p> <p> tmp = arr[i];</p> <p> int j = i-1;</p> <p> while (j>=0 && tmp < arr[j]) {<br /> arr[j+1] = arr[j];<br /> j--;<br /> }<br /> arr[j+1] = tmp;</p> <p> }</p> <p> return rst;<br /> }<br /> }