Create a Quick Sorting Algorithm

Create a Quick Sorting Algorithm definition that will complete the C++ source code. Please complete and show steps.

#include <iostream>

#include "Student_Solution.h"

#include <vector>

#include <fstream>

using namespace std;

bool load_students(vector<Student>& students);

int main()

{

    vector<Student> roster;

    if (load_students(roster))

    {

        //**************************************************************

        //

        //Sort the roster and display the top 5 students here.

        //

        //**************************************************************

    }

    else

    {

        cout << "Error: Could not open file or load students from file.\n";

    }

}

//Loads the students from the file.

bool load_students(vector<Student>& students)

{

    ifstream file;

    file.open("students.txt");

    if (file.is_open())

    {

        string line;

        while (getline(file, line))

        {

            //Find the comma in the file line.

            int comma_index = line.find(',');

            //Use substr to return the student's name.

            string name = line.substr(0, comma_index);

            //Erase the name and the comma to just leave the grade.

            line.erase(0, comma_index + 1);

            //Use "stod" to convert the string to a double.

            double grade = stod(line);

            //Create a student object with his/her name and grade.

            Student s(name, grade);

            //And append it to our vector.

            students.push_back(s);

        }

        file.close();

        return true;

    }

    else

        return false;

}