java資料結構排序之插入排序實現__資料結構

<span style="font-size:18px;">public class InsertSort {</span><pre name="code" class="java">public class InsertSort {static void print(int[] dataList){for (int j = 0; j < dataList.length; j++) {System.out.print(dataList[j]+"  ");}System.out.println();}static void insertSort(int[] dataList){int flag,temp;System.out.print("原始數列為：");print(dataList);for (int i = 1; i < dataList.length; i++) {flag=i;temp=dataList[i];for (int j = i-1; j >= 0; j--) {if(dataList[i]>=dataList[j]){break;}else{flag=j;}}System.out.println("flag="+flag+"待插入的元素為："+dataList[i]);if(flag!=i){for (int j = i-1; j >= flag; j--) {dataList[j+1]=dataList[j];}dataList[flag] = temp;}System.out.print("第"+i+"趟排序的結果為：");print(dataList);}}public static void main(String[] args) {int[] dataList = {13,65,97,76,38,27,49,10};insertSort(dataList);}}