import java.util.Scanner; import java.util.ArrayList; public class UserIDSorting { // TODO: Write the partitioning algorithm - pick the middle element as the // pivot, compare the values using two...

import java.util.Scanner;
import java.util.ArrayList;

public class UserIDSorting {
// 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
public static int partition(ArrayList userIDs, int i, int k) {


}

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

// high partitions
public static void quicksort(ArrayList userIDs, int i, int k) {


}

public static void main(String[] args) {
Scanner scnr = new Scanner(System.in);

ArrayList userIDList = new ArrayList();

String userID;

userID = scnr.next();
while (!userID.equals("-1")) {
userIDList.add(userID);
userID = scnr.next();
}


// Initial call to quicksort

quicksort(userIDList, 0, userIDList.size() - 1);

for (int i = 0; i < useridlist.size();="" ++i)="">
System.out.println(userIDList.get(i));
}
}
}

Extracted text: 17.11 LAB: Sorting user IDs Given a main() that reads user IDs (until -1), complete the quicksort() and partition() methods 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 303250.1795310.gx3zgy7