对整个数组进行冒泡排序

Question

正在做我必须做的作业：

一个。创建三个包含 12 个以上学生记录的数组，包括 ID、学生姓名和

对应的e-mail地址，-学号不分先后

b。使用冒泡排序或选择排序按学号对上述数据进行排序。

c。二进制搜索来自排序数组的五个 ID 和不来自数组的第 6 个 ID。

我已完成所有操作，但排序只对学生 ID 进行排序，我似乎无法理解如何使用冒泡排序对 "studentArray" 中的姓名和电子邮件变量进行排序的逻辑嗯

       #include <iostream>
    #include <iomanip>
    #include <string>
    #include <cmath>


    using namespace std;

    struct Student {
        string name;
        int stuID;
        string email;
    };

    void showInfo(Student *studentArray, int stuCount) {
        cout << "Student Info: " << endl << endl <<
            "\t\tStudent Name" << "\t\tStudent ID" << "\t\tStudent Email" << endl << endl;

        for (int i = 0; i < stuCount; i++)
        {
            cout << "\t\t" << studentArray[i].name << "\t\t" << studentArray[i].stuID << "\t\t\t" << studentArray[i].email << endl;
        }
        cout << endl;
    }

   void displayResult(Student studentArray[], int result, int studCount){
        if (result==-1){
            cout << "Student Id was Not Found"<<endl<< endl;

        }
        else
        cout << "Student Name: " << studentArray[result].name<<endl
        << "Student ID: " <<studentArray[result].stuID<< endl
        << "Student Email: "<< studentArray[result].email<<endl<< endl;
    }


    int binarySearch(Student studentArray[], int stuCount, int idSearch)
         {
         int first = 0,
         last = idSearch - 1,
         middle,
         position = -1;
         bool found = false;
         while (!found && first <= last)
         {
             middle = (first + last) / 2;
             if (studentArray[middle].stuID == stuCount)
             {
             found = true;
             position = middle;
             }
             else if (studentArray[middle].stuID > stuCount)
             last = middle - 1;
             else
             first = middle + 1;
             }
             return position;
             }


    void bubblesortArray(Student *studentArray[], int stuCount)
     {
            bool swap;
            int temp;
        do{
            swap = false;
            for (int count = 0; count < (stuCount - 1); count++)
                {
                if (studentArray[count] > studentArray[count + 1])
                    {
                          temp = studentArray[count];
                        studentArray[count] = studentArray[count + 1];
                        studentArray[count + 1] = temp;
                         swap = true; 
                    }   
            }   
        } while (swap);
     } 




    void recordSearch(Student studentArray[], int stuCount)
    {
        int result;
        int idSearch;
        bool isChar=false;

        for (int i=0; i<13;i++)
            {
            if (i<6)
            {
            cout << "Binary Search: Enter ID Number: ";
            cin >> idSearch;
            }
             else if (idSearch>12||idSearch<0)
            {
                i--;
            }
        if(isChar)
        {
            cout<< "ERROR: Please enter valid number:";

        }

    result=binarySearch(studentArray,idSearch,stuCount);
    displayResult(studentArray,result,idSearch);
        }   
    }




    int main() {


        Student studentArray[13];

        studentArray[0].name = "Bob McBoberston";
        studentArray[0].stuID = 12;
        studentArray[0].email = "BMcboberts@txstate.edu";

        studentArray[1].name = "Shelby Donald";
        studentArray[1].stuID = 1;
        studentArray[1].email = "SDonald@txstate.edu";

        studentArray[2].name = "Ronald Mcdonald";
        studentArray[2].stuID = 11;
        studentArray[2].email = "RMcdonald@txstate.edu";

        studentArray[3].name = "Dick Cheney";
        studentArray[3].stuID = 2;
        studentArray[3].email = "DCheney@txstate.edu";

        studentArray[4].name = "Ben Dover";
        studentArray[4].stuID = 10;
        studentArray[4].email = "BDover@txstate.edu";

        studentArray[5].name = "Ash Katchum";
        studentArray[5].stuID = 3;
        studentArray[5].email = "AKatchum@txstate.edu";

        studentArray[6].name = "Morty Smith";
        studentArray[6].stuID = 9;
        studentArray[6].email = "MSmith@txstate.edu";

        studentArray[7].name = "Rick Sanchez";
        studentArray[7].stuID = 4;
        studentArray[7].email = "RSanchez@txstate.edu";

        studentArray[8].name = "Johnny Bravo";
        studentArray[8].stuID = 8;
        studentArray[8].email = "JBravo@txstate.edu";


        studentArray[9].name = "Tom N. Jerry";
        studentArray[9].stuID = 5;
        studentArray[9].email = "Tnjerry@txstate.edu";

        studentArray[10].name = "Fred Flinstone";
        studentArray[10].stuID = 7;
        studentArray[10].email = "FFlinstone@emial.com";

        studentArray[11].name = "Son Goku";
        studentArray[11].stuID = 6;
        studentArray[11].email = "sGoku@txstate.edu";

        studentArray[12].name = "Johnny Test";
        studentArray[12].stuID = 00;
        studentArray[12].email = "JTest@txstate.edu";

        int stuCount = 13;

        showInfo(studentArray, stuCount);
        bubblesortArray(studentArray,stuCount);
        showInfo(studentArray,stuCount);
        recordSearch(studentArray,stuCount);

    return 0;
    }

Answer 1

                 temp = studentArray[count].stuID;
                 studentArray[count].stuID = studentArray[count + 1].stuID;
                 studentArray[count + 1].stuID = temp;

您只是交换 ID。交换整个 Student 对象：

                 temp = studentArray[count];
                 studentArray[count] = studentArray[count + 1];
                 studentArray[count + 1] = temp;

（您显然需要更改 temp 类型）。

这基本上是使用 struct 和 class 的要点 — 将它们视为一个整体。

对整个数组进行冒泡排序

Bubble Sorting an Array in it's Entirety

c++

arrays

sorting

bubble-sort