算法初步-排序（简单选择排序，归并排序递归与非递归实现，快速排序，随机快速排序）

//简单选择排序，时间复杂度O(n^2)
void selectSort(){
    for(int i=1; i<=n; i++){
        int k = i;
        for(int j=i; j<=n; j++){
            if(A[j]<A[k]){
                k=j;
            }
        }
        int temp = A[i];
        A[i] = A[k];
        A[k] = temp;
    }
}

//归并排序，递归实现
const int maxn = 100;
void merge(int A[], int L1, int R1, int L2, int R2){
    int i = L1, j = L2;//i指向A[L1],j指向A[L2]
    int temp[maxn], index = 0;
    while(i<=R1 && j<=R2){
        if(A[i]<=A[j]){
            temp[index++] = A[i++];
        }else{
            temp[index++] = A[j++];
        }
    }
    while(i <= R1) temp[index++] = A[i++];
    while(j <= R2) temp[index++] = B[j++];
    for(int i=0; i<index; i++){
        A[L1+i] = temp[i];
    }
}
void mergeSort(int A[], int left, int right){
    if(left < right){
        int mid = (left+right)/2;
        mergeSort(A, left, mid);
        mergeSort(A, mid+1, right);
        merge(A, left, mid, mid+1, right);
    }
}

//归并排序，非递归算法，时间复杂度O(nlogn)
void mergeSort(int A[]){
    for(int step=2; step/2<=n; step*=2){
        for(int i=1; i<=n; i+=step){
            int mid = i+step/2-1;
            if(mid+1<=n){
                merge(A, i, mid, mid+1, min(mid+step-1, n));//用到了上面的merge方法
            }
        }
    }
}

//对区间[left,right]进行划分
int Partition(int A[], int left, int right){
    int temp = A[left];
    while(left < right){
        while(left<right&&A[right]>temp) right--;
        A[left] = A[right];
        while(left<right&&A[left]<=temp) left++;
        A[right] = A[left];
    }
    A[left] = temp;
    return left;//返回相遇的坐标
}
//快速排序，时间复杂度O(nlogn)
void quickSort(int A[], int left, int right){
    if(left<right){
        int pos = Partition(A,left,right);
        quickSort(A, left, pos-1);
        quickSort(A, pos+1, right);
    }
}

//选取随机主元
int randPartition(int A[], int left, int right){
    //生成[left,right]之间的随机数p
    int p = (round(1.0*rand()/RAND_MAX*(right-left)+left));
    swap(A[p],A[left]);
    int temp = A[left];
    while(left < right){
        while(left<right&&A[right]>temp) right--;
        A[left] = A[right];
        while(left<right&&A[left]<=temp) left++;
        A[right] = A[left];
    }
    A[left] = temp;
    return left;//返回相遇的坐标
}