#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int cmp(const void *p1, const void *p2) {
const char *v1 = *(const char **)p1;
const char *v2 = *(const char **)p2;
size_t len1 = strlen(v1);
size_t len2 = strlen(v2);
if (len1 < len2) {
return -1;
}
else if (len1 > len2) {
return 1;
}
return 0;
}
int main() {
const char *a[] = {"abcdef", "ghijklmn", "op"};
int n = sizeof(a) / sizeof(a[0]);
qsort(a, n, sizeof(a[0]), cmp);
for (int i = 0; i < sizeof(a)/sizeof(a[0]); ++i) {
printf("%s\n", a[i]);
}
return 0;
}
对一个字符串数组按每个字符串长度排序的C语言实现
最新推荐文章于 2024-10-01 08:56:16 发布