C语言排序

1.冒泡排序1.0

int BubbleSrot0(int array[],int n){
    int i, j;
    int temp;
    for(i = 0; i < n - 1; i++){      //执行n-1次循环
        for(j = i + 1; j < n; j++){    //执行 n-i-1次循环    
            if(array[j] < array[i]){   //如果array[j] > array[i]就交换位置
                temp = array[i];
                array[i] = array[j];
                array[j] = temp;
            }
        }
    }
    return 1;
}

2.冒泡排序2.0

int BubbleSrot1(int array[],int n){
    int i, j;
    int temp;
    for(i = 0; i < n - 1; i++){
        for(j = n - 1; j > i; j--){
            if(array[j] < array[j - 1]){
                temp = array[j];
                array[j] = array[j - 1];
                array[j - 1] = temp;
            }
        }
    }
    return 1;
}

3.冒泡排序3.0

int BubbleSrot2(int array[],int n){
    int i, j;
    int temp, flag;
    for(i = 0; i < n - 1 && flag; i++){
        flag = 0;
        for(j = n - 1; j > i; j--){
            if(array[j] < array[j - 1]){
                temp = array[j];
                array[j] = array[j - 1];
                array[j - 1] = temp;
                flag = 1;
            }
        }
    }
    return 1;
}

4.选择排序

int SelectSort(int array[],int n){
    int i, j, k;
    int temp;
    for(i = 0; i < n - 1; i++){
        k = i;
        for(j = i + 1; j < n; j++){
            if(array[j] < array[k]){
                k = j;
            }
        }
        if(k != i){
         temp = array[k];
         array[k] = array[i];
         array[i] = temp;
        }
    }
    return 1;
}

5.插入排序

int insertSort(int array[],int n){
    int i , j;
    int tempNum;
    for(i = 1; i < n;i++){
        tempNum = array[i];
        for(j = i - 1; j >= 0 && tempNum < array[j];j--){
            array[j + 1] = array[j];
        }
        array[j + 1] = tempNum;
    }
    return 1;
}

• 时间复杂度O(n²)
• 空间复杂度(1)
• 稳定性：稳定
• 最好情况：元素有序
• 最坏情况：元素逆序

6.希尔排序

祥哥的说讲解

int shellSort(int array[],int n){
    int gap,j;
    for(gap = n / 2; gap > 0;gap /= 2){
        for(j = gap;j < n;j++){
            insertShellSort(array,gap,j);
        }
    }
    return 1;
}
int insertShellSort(int array[],int gap,int i){
    int j;
    int insertNum = array[i];
    for(j = i - gap; j>= 0 && insertNum < array[j];j -= gap){
        array[j + gap] = array[j];
    }
    array[j+ gap] = insertNum;
    return 1;
}

7.二路归并排序

doubleguy的讲解

int MergeSort(int array[],int start,int end){
    int mid = (end + start) / 2;
    if(start < end){
        MergeSort(array,start,mid);
        MergeSort(array,mid + 1,end);
        MergeArray(array,start,mid,end);
    }
    return 1;
}

int MergeArray(int array[],int start,int mid,int end){
    int i = start, j = mid + 1;
    int length = end - start + 1;
    int temp[length];
    int k = 0;
    while(i <= mid && j <= end){
        if(array[i] < array[j]){
            temp[k++] = array[i++];
        }else{
            temp[k++] = array[j++];
        }
    }
    while(i <= mid){
        temp[k++] = array[i++];
    }
    while(j <= end){
        temp[k++] = array[j++];
    }
    for(i = 0; i < k; i++){
        array[start++] = temp[i];
    }
    return 1;
}

8.快速排序

int QuickSort(int array[],int low,int high){
    int mid;
    if(low < high){
        mid = Partition(array,low,high);
        QuickSort(array,low,mid - 1);
        QuickSort(array,mid + 1,high);
    }
    return 1;
}
int Partition(int array[],int low ,int high){
    int key = array[low];
    while(low < high){
        while(array[high] >= key && high > low){
            high--;
        }
        array[low] = array[high];
        while(array[low] <= key && high > low){
            low++;
        }
        array[high] = array[low];
    }
    array[low] = key;
    return low;
}