/*********************************************************************************
*@time 2016/08/24 10:09
*@place DHU.13.5005
*description 字符串排序
**********************************************************************************/
#include<cstdio>
#include<cstring>
#include<cstdlib>
int cmp(const void* data1,const void* data2)//从小到大
{
char* str1=*(char**)data1;
char* str2=*(char**)data2;
int result=strcmp(str1,str2);
return result;
}
void string_Sort(char** strings_Container,int num_Of_String)
{
qsort(strings_Container,num_Of_String,sizeof(char*),cmp);
}
int main()
{
int num_Of_String;
printf("input the num of strings:");
scanf("%d",&num_Of_String);
char** strings_Container=new char*[num_Of_String];//构造容器
printf("input all strings\n");
for(int i=0;i<num_Of_String;i++)
{
char tmpStrimg[100];
scanf(" %s",tmpStrimg);
//将字符串加入到容器中
int length=strlen(tmpStrimg);
strings_Container[i]=new char[length];
strcpy(strings_Container[i],tmpStrimg);
}
string_Sort(strings_Container,num_Of_String);//排序
printf("\n");
for(int i=0;i<num_Of_String;i++)
{
printf("%s\n",strings_Container[i]);
}
return 0;
}
字符串排序
最新推荐文章于 2024-05-19 21:39:33 发布