#include<stdio.h>#include<string.h>char *cut_word(char str[],int *pos){ char static sub[10]; int j = 0; while(str[*pos] == ' ' ) (*pos)++; while(str[*pos] != ' ' && str[*pos] != '\0') sub[j++] = str[(*pos)++]; sub[j] = '\0'; return sub;}void bubblesort(char str[][10],int num[],int row){ int i, j, t; int flag; char s[10]; for(i = 1;i < row;i++) { flag = 1; for(j = 0;j < row;j++) { if(stricmp(str[j], str[j + 1]) > 0) { strcpy(s,str[j]); strcpy(str[j],str[j+1]); strcpy(str[j+1],s); t = num[j]; num[j] = num[j+1]; num[j+1] = t; flag = 0; } } if(flag) break; } }int main(){ int row = 0, num[100] = { 0 }, temp = 1, pos = 0; char strstr[1000], * substr, newstr[100][10]; gets(strstr); substr = cut_word(strstr,&pos); strcpy(newstr[row],substr); num[row]++; row++; while(1) { substr = cut_word(strstr,&pos); temp = 1; for(int j = 0;j < row;j++) { if(strcmp(newstr[j],substr) == 0) { num[j]++; temp = 0; break; } } if(temp) { strcpy(newstr[row],substr); num[row]++; row++; } if(strstr[pos] == '\0') break; } bubblesort(newstr,num,row); for(int i = 0;i < row;i++) printf("%-10s%d\n", newstr[i], num[i]); return 0; }这个代码出现了一些问题，能帮我更改吗

当输入的字符串超过一定长度时，使用 `gets()` 函数可能会导致缓冲区溢出，因此建议改用 `fgets()` 函数。此外，该代码中的冒泡排序算法效率较低，建议改用其他排序算法，如快速排序算法。

以下是更改后的代码：

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

char *cut_word(char str[], int *pos) {
    static char sub[10];
    int j = 0;
    while (str[*pos] == ' ') {
        (*pos)++;
    }
    while (str[*pos] != ' ' && str[*pos] != '\0') {
        sub[j++] = str[(*pos)++];
    }
    sub[j] = '\0';
    return sub;
}

void quicksort(char str[][10], int num[], int left, int right) {
    if (left >= right) {
        return;
    }
    int i = left, j = right;
    int pivot = num[left + (right - left) / 2];
    while (i <= j) {
        while (num[i] > pivot) {
            i++;
        }
        while (num[j] < pivot) {
            j--;
        }
        if (i <= j) {
            char temp[10];
            strcpy(temp, str[i]);
            strcpy(str[i], str[j]);
            strcpy(str[j], temp);
            int t = num[i];
            num[i] = num[j];
            num[j] = t;
            i++;
            j--;
        }
    }
    quicksort(str, num, left, j);
    quicksort(str, num, i, right);
}

int main() {
    int row = 0, num[100] = {0}, temp = 1, pos = 0;
    char strstr[1000], *substr, newstr[100][10];
    fgets(strstr, 1000, stdin);
    substr = cut_word(strstr, &pos);
    strcpy(newstr[row], substr);
    num[row]++;
    row++;
    while (1) {
        substr = cut_word(strstr, &pos);
        temp = 1;
        for (int j = 0; j < row; j++) {
            if (strcmp(newstr[j], substr) == 0) {
                num[j]++;
                temp = 0;
                break;
            }
        }
        if (temp) {
            strcpy(newstr[row], substr);
            num[row]++;
            row++;
        }
        if (strstr[pos] == '\0') {
            break;
        }
    }
    quicksort(newstr, num, 0, row - 1);
    for (int i = 0; i < row; i++) {
        printf("%-10s%d\n", newstr[i], num[i]);
    }
    return 0;
}