在C中的结构中进行冒泡排序

v8wbuo2f  于 2023-10-16  发布在  其他
关注(0)|答案(1)|浏览(132)

我已经编写了一个基于结构数组的程序，它的所有部分都很好，但是我的一个函数sort_student函数有一个bug。在这个代码中，首先用户将输入一些学生和他们的信息，包括名字，姓氏，id和平均值，之后用户将有几个选项，除了排序功能外，所有选项都可以。这个函数的主要问题是，它只能对平均值进行排序，然后它会把第一个学生的名字，姓氏和id放在所有学生的结构中，我不知道怎么解决这个问题。我想我不得不说，我是业余的编码，所以请帮助，如果你想帮助，如果你不想请不要发表负面评论。谢谢.
这是有问题的函数：

  1. void sort_student()
  2. {
  3.     float selected_item;
  4.     int j;
  6.     for (int i = 0; i < students_count; i++)
  7.     {
  8.         selected_item = student[i].average;
  9.         j = i - 1;
  10.         while ((j >= 0) && (selected_item < student[j].average))
  11.         {
  12.             student[j + 1].average = student[j].average;
  13.             strcpy(student[j + 1].first_name, student[j].first_name);
  14.             strcpy(student[j + 1].last_name, student[j].last_name);
  15.             strcpy(student[j + 1].id, student[j].id);
  17.             j--;
  18.         }
  19.         student[j + 1].average = selected_item;
  20.     }
  22.     printf("The students are sorted now.");
  23. }

如果你需要，这是我所有的代码：

  1. #include <stdio.h>
  2. #include <string.h>
  3. #include <stdlib.h>
  5. struct school
  6. {
  7.     char first_name[80];
  8.     char last_name[80];
  9.     char id[12];
  10.     float average;
  11. };
  13. struct school *student;
  15. int students_count;
  16. int con = 1;
  17. int chosen_option;
  19. FILE *fptr;
  21. void options();
  22. void add_student();
  23. void remove_student();
  24. void search_student();
  25. void sort_student();
  26. void save_to_file();
  27. void upload_students();
  29. int main() {
  30.     student = calloc(300, sizeof *student);
  32.     printf("How many students do you have ? (MAX = 300)\n");
  33.     scanf("%d", &students_count);
  35.     for (int i = 0; i < students_count; i++)
  36.     {
  37.         printf("Whats your student number %d first name ? \n", i+1);
  38.         scanf("%79s", student[i].first_name);
  40.         printf("Whats your student number %d last name ? \n", i+1);
  41.         scanf("%79s", student[i].last_name);
  43.         printf("Whats your student number %d id ? \n", i+1);
  44.         scanf("%11s", student[i].id);
  46.         printf("Whats your student number %d average ? \n", i+1);
  47.         scanf("%f", &student[i].average);
  48.     }
  50.     printf("\nOK! you've entered the students and their information successfully.\n");
  52.     while (con == 1)
  53.     {
  54.         options();
  55.     }
  56.     return 0;
  57. }
  59. void options()
  60. {
  61.     printf("\nOK! Do you want to continue? (Yes : 1/N : 0)");
  62.     scanf("%d", &con);
  64.     if (con == 1)
  65.     {
  66.         printf("What do you want to do now ? \n");
  68.         printf("\n1. Add student\n");
  69.         printf("\n2. Remove student\n");
  70.         printf("\n3. Search student\n");
  71.         printf("\n4. Sort by average\n");
  72.         printf("\n5. save the students information in a file\n");
  73.         printf("\n6. upload all of students information\n");
  75.         printf("\nPlease enter the number of you choice : ");
  76.         scanf("%d", &chosen_option);
  78.         switch (chosen_option) {
  79.             case 1:
  80.                 add_student();
  81.                 break;
  82.             case 2:
  83.                 remove_student();
  84.                 break;
  85.             case 3:
  86.                 search_student();
  87.                 break;
  88.             case 4:
  89.                 sort_student();
  90.                 break;
  91.             case 5:
  92.                 save_to_file();
  93.                 break;
  94.             case 6:
  95.                 upload_students();
  96.                 break;
  97.             default:
  98.                 printf("Your chosen option is invalid\n");
  99.                 break;
  100.         }
  101.     }
  102.     else if (con == 0)
  103.     {
  104.         printf("OK! You don't want to continue. Bye!\n");
  105.         exit(0);
  106.     } else
  107.     {
  108.         printf("You can't continue with invalid options.\n");
  109.         exit(0);
  110.     }
  111. }
  113. void add_student()
  114. {
  115.         printf("Whats your (new) student number %d first name ? \n", students_count+1);
  116.         scanf("%79s", student[students_count].first_name);
  118.         printf("Whats your (new) student number %d last name ? \n", students_count+1);
  119.         scanf("%79s", student[students_count].last_name);
  121.         printf("Whats your (new) student number %d id ? \n", students_count+1);
  122.         scanf("%11s", student[students_count].id);
  124.         printf("Whats your (new) student number %d average ? \n", students_count+1);
  125.         scanf("%f", &student[students_count].average);
  127.         students_count ++;
  129.     printf("OK! You've entered the new student information successfully.\n");
  130. }
  131. void remove_student()
  132. {
  133.     char removing_id[12];
  134.     int i;
  136.     printf("\nPlease enter the id of student that you want to remove : ");
  137.     scanf("%11s", removing_id);
  139.     for (i = 0; i < students_count; i++)
  140.     {
  141.         if (strcmp(removing_id, student[i].id) == 0)
  142.         {
  143.             for (int j = i; j < students_count - 1; j++)
  144.             {
  145.                 strcpy(student[j].first_name, student[j+1].first_name);
  146.                 strcpy(student[j].last_name, student[j+1].last_name);
  147.                 strcpy(student[j].id, student[j+1].id);
  148.                 student[j].average = student[j+1].average;
  149.             }
  150.             break;
  151.         }
  152.     }
  154.     if(i == students_count)
  155.     {
  156.         printf("The id is not available!");
  157.         exit(0);
  158.     }
  159.     else
  160.     {
  161.         students_count--;
  162.         printf("The student removed successfully.");
  163.     }
  164. }
  165. void search_student()
  166. {
  167.     char searching_id[12];
  168.     int i;
  170.     printf("\nPlease enter the id of student that you want to search : ");
  171.     scanf("%11s",searching_id);
  173.     for (i = 0; i < students_count; i++)
  174.     {
  175.         if (strcmp(searching_id, student[i].id) == 0)
  176.         {
  177.             printf("\nFIRSTNAME    LASTNAME    ID    AVERAGE\n");
  179.             printf("\n%s\t%s\t%s\t%.2f\n", student[i].first_name, student[i].last_name, student[i].id,
  180.                    student[i].average);
  181.         }
  182.     }
  184.     if (i == students_count)
  185.     {
  186.         printf("We don't have student with this id.");
  187.     }
  188. }
  189. void sort_student()
  190. {
  191.     float selected_item;
  192.     int j;
  194.     for (int i = 0; i < students_count; i++)
  195.     {
  196.         selected_item = student[i].average;
  197.         j = i - 1;
  198.         while ((j >= 0) && (selected_item < student[j].average))
  199.         {
  200.             student[j + 1].average = student[j].average;
  201.             strcpy(student[j + 1].first_name, student[j].first_name);
  202.             strcpy(student[j + 1].last_name, student[j].last_name);
  203.             strcpy(student[j + 1].id, student[j].id);
  205.             j--;
  206.         }
  207.         student[j + 1].average = selected_item;
  208.     }
  210.     printf("The students are sorted now.");
  211. }
  212. void save_to_file()
  213. {
  214.     fptr = fopen("MY SCHOOL FILE.txt", "w");
  216.     fprintf(fptr, "#    FIRSTNAME    LASTNAME    ID    AVERAGE\n");
  218.     for(int i = 0; i < students_count; i++)
  219.     {
  220.         fprintf(fptr, "%d\t%s\t%s\t%s\t%.2f\n", i+1, student[i].first_name, student[i].last_name,
  221.                 student[i].id, student[i].average);
  222.     }
  224.     fclose(fptr);
  226.     printf("\nThe file is in project folder.\n");
  227. }
  229. void upload_students()
  230. {
  231.     printf("#    FIRSTNAME    LASTNAME    ID    AVERAGE\n");
  232.     for (int i = 0; i < students_count; i++)
  233.     {
  234.         printf("%d\t%s\t%s\t%s\t%.2f\n", i+1, student[i].first_name, student[i]. last_name,
  235.                student[i].id, student[i].average);
  236.     }
  237. }
c

1条答案

按热度按时间
kqqjbcuj

kqqjbcuj1#

对于初学者来说，函数sort_student中没有使用冒泡排序方法。实际上，你正在尝试实现插入排序方法。
在这个while循环中

  1. while ((j >= 0) && (selected_item < student[j].average))
  2.     {
  3.         student[j + 1].average = student[j].average;
  4.         strcpy(student[j + 1].first_name, student[j].first_name);
  5.         strcpy(student[j + 1].last_name, student[j].last_name);
  6.         strcpy(student[j + 1].id, student[j].id);
  8.         j--;
  9.     }

元素student[i]的所有数据成员都被覆盖。
该函数可以如下所示

  1. void sort_student( void )
  2. {
  3.     for ( int i = 1; i < students_count; i++ )
  4.     {
  5.         struct school current_student = student[i];
  7.         int j = i;
  9.         for ( ; j != 0 && current_student.average < student[j - 1].average; --j )
  10.         {
  11.             student[j] = student[j-1];
  12.         }
  14.         if ( j != i ) student[j] = current_student;
  15.     }
  17.     printf("The students are sorted now.");
  18. }
展开查看全部
赞(0）分享  回复(0）举报  2023-10-16
我来回答

相关问题

    查看更多

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新问答

    更多
    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com