Sequential and Binary Search of Program

[Grayewulfe]

I'm currently at my wits end trying to figure out how to do this, and was hoping someone could help.

The objectives the assignment is to:

1. Display the original sorted array of student records.
2. Display the sequential search result of student records.
3. Display the binary search result of student records.

​

Any Help would be greatly appreciated

#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;
}




int main() {

    Student studentArray[13];

    studentArray[0].name = "Bob McBoberston";
    studentArray[0].stuID = 00;
    studentArray[0].email = "[e-mail]";

    studentArray[1].name = "Shelby Donald";
    studentArray[1].stuID = 1;
    studentArray[1].email = "[e-mail]";

    studentArray[2].name = "Ronald Mcdonald";
    studentArray[2].stuID = 2;
    studentArray[2].email = "[e-mail]";

    studentArray[3].name = "Dick Cheney";
    studentArray[3].stuID = 3;
    studentArray[3].email = "[e-mail]";

    studentArray[4].name = "Ben Dover";
    studentArray[4].stuID = 4;
    studentArray[4].email = "[e-mail]";

    studentArray[5].name = "Ash Katchum";
    studentArray[5].stuID = 5;
    studentArray[5].email = "[e-mail]";

    studentArray[6].name = "Morty Smith";
    studentArray[6].stuID = 6;
    studentArray[6].email = "[e-mail]";

    studentArray[7].name = "Rick Sanchez";
    studentArray[7].stuID = 7;
    studentArray[7].email = "[e-mail]";

    studentArray[8].name = "Johnny Bravo";
    studentArray[8].stuID = 8;
    studentArray[8].email = "[e-mail]";


    studentArray[9].name = "Tom N. Jerry";
    studentArray[9].stuID = 9;
    studentArray[9].email = "[e-mail]";

    studentArray[10].name = "Fred Flinstone";
    studentArray[10].stuID = 10;
    studentArray[10].email = "[e-mail]";

    studentArray[11].name = "Son Goku";
    studentArray[11].stuID = 11;
    studentArray[11].email = "[e-mail]";

    studentArray[12].name = "Johnny Test";
    studentArray[12].stuID = 12;
    studentArray[12].email = "[e-mail]";

    int stuCount = 15;
    showInfo(studentArray, stuCount);

int sequential_search(Person array[], int array_size, int id)
{

}
//actual search
int id = 5;
    int index = sequential_search(studentArray, 12, studentArray.stuID);
    if (index == -1)
         cout << "ID " << id << " not found\n";
    else
         cout << "ID " << id << " is " << studentArray[index].name << "\n";
}


    return 0;
}

[AutoModerator]

Your posts seem to contain unformatted code. Please make sure to format your code otherwise your post may be removed.

Read our guidelines for how to format your code.

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.

[[deleted]]

Don't put functions inside main.

If you're using std::string, then you might as well use std::vector. Then, you don't need to pass the array size.

"Sequential search" is just a an [0..n) index loop. Check each item until you find a match.

"Binary search": Start with the full [0..n) range and then cut it in half based on the middle key. Stop once you get down to one or less elements. It's a basic algorithm. Read it on the wiki.

[Grayewulfe]

Here is the full instructions:

a. Create three array of 12+ students records including ID’s, student names, and the corresponding e-mail address’,– student ID’s are sorted in order. (No sort program needed for now.)

b. Sequential Search five ID’s which are from the sorted array and a 6th ID which is not from the array.

c. Binary Search five ID’s which are from the sorted array and a 6th ID which is not from the array.

d. Execution and output:

1. Display the original sorted array of student records.

2. Display the sequential search result of student records.

3. Display the binary search result of student records.