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

void find(char name[][7], int n, int *p) { int min_index = 0; for (int i = 1; i < n; i++) { if (strcmp(name[i], name[min_index]) < 0) { min_index = i; } } *p = min_index; }

int main() { char name[1000][7]; int n = 0; while (scanf("%s", name[n]) != EOF) { if (strcmp(name[n], "###") == 0) { break; } n++; } int min_index; find(name, n, &min_index); printf("%s\n", name[min_index]); return 0; }

C语言字符串最小值查找算法实现

原文地址: https://www.cveoy.top/t/topic/ojKB 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录