冒泡排序

题目：将二维数组中的字符串排序，*characters[] = {"Computer","com.munication","ConsumerElectronics","android","IOS",".text","notepad++","eclipse","code.blocks","VS studio 2015"};

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

char *characters[] = {"Computer","com.munication","ConsumerElectronics","android","IOS",".text","notepad++","eclipse","code.blocks","VS studio 2015"};

void sort(char *p[], int n)//冒泡排序
{
    char *tmp;
    int i, j, k;
    for(i = 0; i < (n - 1); ++i)
    {
        k = i;
        for(j = (i + 1); j < n; ++j)
        {
            if(stricmp(p[k], p[j]) > 0)//比较字符串大小的函数stricmp()
            {
                k = j;
            }
        }
        if(k != i)
        {
            tmp = p[k];
            p[k] = p[i];
            p[i] = tmp;
        }
    }
}

int main()
{
    int n = sizeof(characters)/sizeof(characters[0]);//计算characters的行数
    sort(characters, n);//传参要统一characters是指向指针的指针
    int i;
    for(i = 0; i < n; ++i)
    {
        printf("%s
", characters[i]);
    }

    return 0;
}

结果如下：