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 output the sorted IDs one per line. Ex. If the input is: kaylasimms julia myron1994 kaylajones -1 the output is: julia kaylajones kaylasimms myron1994 I can only change the //TODO and please answer in C++ #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) << endl;; } return 0; }
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
Ex. If the input is:
kaylasimmsthe output is:
julia
I can only change the //TODO and please answer in C++
#include <string>
#include <vector>
#include <iostream>
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<string> &userIDs, int i, int k) {
}
// TODO: Write the quicksort algorithm that recursively sorts the low and
// high partitions
void Quicksort(vector<string> &userIDs, int i, int k) {
}
int main(int argc, char* argv[]) {
vector<string> 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) << endl;;
}
return 0;
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
