冒泡法

beyes

code:

[C++] 纯文本查看 复制代码

#include <stdio.h>


#define MAX 8


int main()
{
        int b[MAX] = {10, 33, 63, 8, 91, 100, 22, 15};
        int i, k, temp;


        for (i = 0; i < MAX - 1; i++)
                for (k = i + 1; k < MAX; k++)
                        if (b[i] > b[k]) {
                                temp = b[k];
                                b[k] = b[i];
                                b[i] = temp;
                        }


        for (i = 0; i < MAX; i++)
                printf ("%d ", b[i]);


        printf ("\n");


        return 0;
}