冒泡、选择、快速排序法代码

/* 冒泡排序法 */
#include <stdio.h>
#include <stdlib.h>

int main()
{
    int i,j,tmp;
    int num[5]={2,6,4,8,3};
    for(i=0;i<5;i++)
    {
        for(j=0;j<5-i-1;j++)
        {
            if(num[j]<num[j+1])
            {
                tmp=num[j];
                num[j]=num[j+1];
                num[j+1]=tmp;
            }
        }
    }
    for(i=0;i<5;i++)
        printf("%d ",num[i]);
    printf("\n");
    system("pause");
    return 0;
}
/* 先把最小的或者最大的找出来，放在首位或者末位，同时减少一次后续的比较次数。越往后比较的次数越少 */

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int i,j,tmp;
    int num[5]={2,6,4,8,3};
    for(i=0;i<5;i++)
    {
        int dex = i;
        for(j=i+1;j<5;j++)
        {
            /* 如果遇到后面的元素有比index下标大的，标记下来，次步挑出最大或者最小 */
            if(num[j]>num[dex])
                dex=j;
        }
        /* 如果排序前该位就是最大或者最小，则不需要执行else */
        if(dex==i)
            continue;
        else
        {
            tmp=num[dex];
            num[dex]=num[i];
            num[i]=tmp;
        }
       
    }
    for(i=0;i<5;i++)
        printf("%d ",num[i]);
    printf("\n");
    system("pause");
    return 0;
}
/* 选择排序法 */

#include <stdio.h>
void Bubble_Sort(int *nums, int lenth);
void Select_Sort(int *nums, int lenth);
void Quick_sort(int *nums,int first, int lenth);
int main(void)
{
        int array[9] = {13,5,67,9,0,43,18,10,99};
        int len = sizeof(array)/sizeof(int);
        Bubble_Sort(array,len);
        Select_Sort(array,len);
        Quick_sort(array,0,len-1);
        printf("快速排序：");
        for(int i=0;i<len;i++){
                printf("%d ",array[i]);
        }
        printf("\n");
        return 0;
}
void Quick_sort(int *nums,int first, int lenth)
{
        int left = first;
        int right = lenth;
        int key = nums[first];
        while(left < right){
                while(left<right && nums[right]<=key){
                        right--;
                }
                if(left<right)
                        nums[left++] = nums[right];
                while(left<right && nums[left]>key){
                        left++;
                }
                if(left<right)
                        nums[right--] = nums[left];
        }
        nums[left] = key;
        if(first < left-1)
                Quick_sort(nums, first ,left-1);
        if(left+1 <lenth)
                Quick_sort(nums,left+1,lenth);
}
void Select_Sort(int *nums, int lenth)
{
        int i,j,tmp;
        int indnx;
        for(i=0;i<lenth-1;i++){
                indnx = i;
                for(j=i+1;j<lenth-i;j++){
                        if(nums[indnx] > nums[j]){
                                indnx = j;
                        }
                        if(indnx == i)
                                continue;
                        else{
                                tmp = nums[j];
                                nums[j] = nums[i];
                                nums[i] = tmp;
                        }
                }
        }
        printf("选择排序：");
        for(i=0;i<lenth;i++){
                printf("%d ",nums[i]);
        }
        printf("\n");
}

void Bubble_Sort(int *nums, int lenth)
{
        int i,j,tmp;
        for(i=0;i<lenth-1;i++){
                for(j=0;j<lenth-i-1;j++){
                        if(nums[j] > nums[j+1]){
                                tmp = nums[j+1];
                                nums[j+1] = nums[j];
                                nums[j] = tmp;
                        }
                }
        }
        printf("冒泡排序：");
        for(i=0;i<lenth;i++){
                printf("%d ",nums[i]);
        }
        printf("\n");
}