C/C++ 查找字符串数组中的最小字符串

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

void find(char *name[], int n, int *p);

int main() { char *name[100]; int n = 0; while (1) { char *str = (char *)malloc(sizeof(char) * 7); scanf('%s', str); if (strcmp(str, '####') == 0) { free(str); break; } name[n++] = str; } int minIndex; find(name, n, &minIndex); printf('%s ', name[minIndex]); for (int i = 0; i < n; i++) { free(name[i]); } return 0; }

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