15.11 LAB: Sorting user IDs C++ Given a main() that reads user IDs (until -1), complete the Quicksort() and Partition() functions to sort the IDs in ascending order using the Quicksort algorithm, and...

#include
#include
#include

using namespace std;

// TODO: Write the partitioning algorithm - pick the middle element as the
// pivot, compare the values using two index variables l and h (low and high),
// initialized to the left and right sides of the current elements being sorted,
// and determine if a swap is necessary
int Partition(vector &userIDs, int i, int k) {

}

// TODO: Write the quicksort algorithm that recursively sorts the low and
// high partitions
void Quicksort(vector &userIDs, int i, int k) {

}

int main(int argc, char* argv[]) {
vector userIDList;
string userID;

cin >> userID;
while (userID != "-1") {
userIDList.push_back(userID);
cin >> userID;
}

// Initial call to quicksort
Quicksort(userIDList, 0, userIDList.size() - 1);

for (size_t i = 0; i < useridlist.size();="" ++i)="">
cout < useridlist.at(i)=""><>
}

return 0;
}