冒泡排序

#include <stdio.h>
#include <assert.h>
 #include <stdlib.h>
#include<string.h>
void bubble_sort(int *data, int size)
{
    int i  = 0;
    int j  = 0;

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

        for(j=0; j<size-1-i; j++)
        {
            if(data[j+1] < data[j])
            {
                int swap = data[j];
                data[j] = data[j+1];
                data[j+1] = swap;

                ordered = 0;
            }
        }
        if(ordered)
        {
            break;
        }
    }
}
int main(void)
{
      int a[5]={1,33,22,11,5};
      bubble_sort(a,5);
      int i = 0;
      for(i =0; i<5;i++)
      printf("%d\n",a[i]);
     return 0;

}