空间复杂度为1的插入，冒泡，归并…

这种排序，还是链表比较舒服，用数组，增加了很多时间复杂度

package lengyu.sort;

public class BaseSort {

public static void insertSort(int[] oriArray) {

int count = 0;

int length = oriArray.length;

for (int i = 0; i < length; i++) {

for (int j = 0; j < i; j++) {

if (oriArray[j] < oriArray[i]) {

int tmp = oriArray[j];

oriArray[j] = oriArray[i];

oriArray[i] = tmp;

}

count++;

}

}

System.out.println("count = " + count);

}

public static void BubbleSort(int[] oriArray) {

int count = 0;

int length = oriArray.length;

for (int i = 0; i < length; i++) {

for (int j = length - 1; j > i; j--) {

if(oriArray[j]

int tmp = oriArray[j];

oriArray[j] = oriArray[j-1];

oriArray[j-1] = tmp;

}

count++;

}

}

System.out.println("count = " + count);

}

static int countM = 0;

public static void MergeSort(int[] oriArray,int start,intend){

System.out.println(start+"---"+end);

if (end-start>=2){

int mid = (start+end)/2;

MergeSort(oriArray,start,mid);

MergeSort(oriArray,mid+1,end);

int index = mid+1;

for(int i = start ; i <= mid ; i ++){

for(int j = index ; j <= end ; j ++){

if(oriArray[i]

int tmp = oriArray[j];

oriArray[j] = oriArray[i];

oriArray[i] = tmp;

}

countM++;

}

}

}

else{

if(oriArray[start]

int tmp = oriArray[start];

oriArray[start] = oriArray[end];

oriArray[end] = tmp;

}

countM++;

}

}

public static void main(String[] args) {

int[] testArray = {1,3,2,4,5};

MergeSort(testArray,0,4);

System.out.println(testArray[0]);

System.out.println(countM);

}

}