冒泡排序

#include<stdio.h>void sort(int *p, int l);void main(void){   int i = 0;   int p[7] = {3, 5, 9, 11, 2, 6, 19};   sort(p, 7);   for(; i < 7; i++)   {     printf("%2d\n", p[i]);   }}void sort(int *p, int l){    int max, maxk, tmp;    int i = 0;    int k = 0;    for( ; i < l; i++)    {       max = p[i];       for(k = i; k < l; k++)       {         if( p[k] > max)         {             max = p[k];             p[k] = p[i];             p[i] = max;         }       }    }}