冒泡排序之前奏---“潜伏”

冒泡排序之前奏—“潜伏”

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

// 冒泡排序---先把一个大数沉底
void main()
{
    //int a[10] = { 3,7,15,20,9,10,4,30,16,1 };
#define N 10
    time_t ts;
    unsigned int data = time(&ts);
    srand(data);

    int a[N] = {0};// 数组必须初始化
    for (int i = 0; i < N; ++i)
    {

        a[i] = rand() % 30;
        printf("%d ", a[i]);

    }
    {
        printf("\n");
        for (int i = 0; i < 10; ++i)
        {
            printf("%d  ", a[i]);
        }
        printf("\n");
    }


    for (int i = 0; i < N - 1; ++i)
    {

        if (a[i] > a[i + 1])
        {
            int temp = a[i];//交换
            a[i] = a[i + 1];
            a[i + 1] = temp;

        }
        for (int i = 0; i < 10; ++i)
        {
            printf("%d  ", a[i]);
        }
        printf("\n");
    }

    //printf("%d", a[9]);

    system("pause");
}