排序算法一：冒泡排序

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/zgj289563749/article/details/82820820

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

void show(int *num, int len)
{
    int i;
    for (i = 0; i < len; i++) 
        printf("%3d", num[i]);
    printf("\n");
}

void bubble_sort(int *num, int len)
{
    int i, j, temp;
    for (i = 0; i < len - 1; i++)
        for (j = 0; j < len -i - 1; j++) {
            if (num[j] > num[j+1]) {
                temp = num[j];
                num[j] = num[j+1];
                num[j+1] = temp;
            }
        }
}

int main(int argc, char *argv[])
{
    int num[10];
    srand(time(NULL));
    int i;
    for(i = 0; i < 10; i++)
        num[i] = rand() % 100;

    show(num, 10);
    bubble_sort(num, 10);
    show(num, 10);

    return 0;
}