$10\mathrm{.}10$ LAB: Sorting user IDs

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

myron$1994$

kaylajones

$-1$

$```$

the output is:

$```$

julia

kaylajones

kaylasimms

myron$1994$

$```$

$```$

main.cpp

#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 l$,$ int h$)\{$

$\}$

$//$ TODO: Write the quicksort algorithm that recursively sorts the low and

$//$ high partitions

void Quicksort$($vector &userIDs, int l$,$ int h$)\{$

$\}$

$``````$

int main$()\{$

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$;

$```$