插入排序

 1 public class Solution
 2 {
 3     public void insertSort(int[] data)
 4     {
 5         for(int i = 1; i < data.length; i ++)
 6         {
 7             for(int j = i - 1; j >= 0; j --)
 8             {
 9                 if(data[j] > data[j + 1])
10                 {
11                     exchange(data, j, j + 1);
12                 }
13                 else
14                 {
15                     break;
16                 }
17             }
18         }
19     }
20     
21     public void exchange(int[] data, int m, int n)
22     {
23         int memory = data[m];
24         data[m] = data[n];
25         data[n] = memory;
26     }
27     
28 }