publicstaticint[] insertSort(int[] array)
{
for (int i =1; i < array.Length; i++) //遍历需要排序的数组
{
int j =0;
while (j < i && array[j] < array[i]) //找到满足条件的待插入数
{
j++;
}

int temp = array[i]; //保存待插入的数
int Last = i;

while (Last > j) //数组往后移动
{
array[Last] = array[Last -1];
Last--;
}
array[j] = temp; //把需要插入的数，插入到第j个位置
}
return array;
}

 1 public static int paration(Integer[] arrayList,int begin,int end){
 2         int temp=arrayList[begin];
 3         while (begin<end) {
 4             while (begin<end&&arrayList[end]>temp) {
 5                 end--;
 6             }
 7             if (begin<end) {
 8                 arrayList[begin]=arrayList[end];
 9                 begin++;
10             }
11             while (begin<end&&arrayList[begin]<temp) {
12                 begin++;
13             }
14             if (begin<end) {
15                 arrayList[end]=arrayList[begin];
16                 end--;
17             }
18         }
19         arrayList[begin]=temp;
20         return begin;
21     }
22     public static void quickSort(Integer[] arrayList,int begin,int end){
23         if(begin>=end)
24             return;
25         int par=paration(arrayList, begin, end);
26         if(begin<par-1)
27             quickSort(arrayList, begin, par-1);
28         if (par+1<end)
29             quickSort(arrayList, par+1, end);
30
31     }