冒泡排序算法

#include <stdio.h>

int main()
{
        int array[] = {38,87,45,26,112,345,1,4,6,6,9,26};
        int i;
        int j;
        int tmp;
        int len = sizeof(array)/sizeof(array[0]);
        for(i=0;i<len-1;i++){
                for(j=0;j<len-1-i;j++){
                        if(array[j] > array[j+1]){
                                tmp = array[j];
                                array[j] = array[j+1];
                                array[j+1] = tmp;
                        }
                }
        }
        for(i=0;i<len;i++){
                printf("%d ",array[i]);
        }
        printf("\n");
 }