字符串数组的冒泡排序，从小到大

#include <stdio.h>
#include <string.h>


void sort(char a[][10],int n)
{
int i,j;
char temp[10];

//冒泡排序
for(j = 0;j < n - 1;j++)
for(i = 0;i < n - 1 - j;i++)
if(strlen(a[i])>strlen(a[i+1])) //比较字符串长度
{
strcpy(temp,a[i]);
strcpy(a[i],a[i+1]);
strcpy(a[i+1],temp);
}

printf("The sorted:\n");
for(i = 0;i < n;i++)
{
printf("%s\n",a[i]);
}


}
int main()
{
char a[6][10] = {"abcd","efg","hijkl","mn","opqrstu","wiue"};
int i;


for(i = 0;i < 6;i++)
{
printf("%s\n",a[i]);
}
    
sort(a,6);


printf("\n");


    return 0;
}