C语言冒泡函数的封装

#include <stdio.h>
int mp(int a[],int n)
{
int i,j;
for (i=0;i<n-1;i++)
for (j=0;j<n-1-i;j++)
{
if (a[j]>a[j+1])
{
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
return 0;
}
int main(int argc,char *argv[])
{
int a[]={23,43,36,236,53,463,231,865};
int n=sizeof(a)/sizeof(a[0]);
int k;
mp(a,n);
for (k=0;k<n;k++)
printf ("%d ",a[k]);
printf("\n");
return 0;
}