冒泡排序算法

 #include <stdio.h>                                                             

int main()
{
    printf("bubble sort:\n");
    int list[] = {2,4,7,1,9,10,23,5,6,2,9,6,33,26};
    int i = 0;
    int j = sizeof(list)/sizeof(int) - 1;

    int flag = 0;
    do
    {
        flag = 0;
        for(i = 0; i < j; i++)
        {
            if (list[i] > list[i+1])
            {
                int temp = list[i];
                list[i] = list[i+1];
                list[i+1] = temp;
                flag = 1;
            }
        }
    }while(flag && --j);

    for ( i = 0; i < sizeof(list)/sizeof(int); i++)
    {
        printf("%d ",list[i]);
    }
    printf("\n");
    return 0;
}