public static int partition (ArrayList userIDs, int i, int k) {
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Needs help to complete this program. Thank you.
Screen shots are attached.
![LAB
7.16.1: LAB: Sorting user IDs
0/10
ACTIVITY
UserIDSorting.java
Load default template.
Emport 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<String> userIDs, int i, int k) {
}
// TODO: Write the quicksort algorithm that recursively sorts the low and |
//
high partitions
public static void quicksort (Arraylist<String> userIDs, int i, int k) {
public static void main (String[] args) {
Scanner scnr = new Scanner (System.in);
Arraylist<String> userIDList = new ArrayList<String> ();
String userID;
userID = 3cnr.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));
}
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdf5dac53-f5e4-4684-a2cf-d68aa8ae8809%2F55970ed7-92f1-44e7-9711-76d2f8e30d48%2Fiu25ehk_processed.png&w=3840&q=75)
Transcribed Image Text:LAB
7.16.1: LAB: Sorting user IDs
0/10
ACTIVITY
UserIDSorting.java
Load default template.
Emport 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<String> userIDs, int i, int k) {
}
// TODO: Write the quicksort algorithm that recursively sorts the low and |
//
high partitions
public static void quicksort (Arraylist<String> userIDs, int i, int k) {
public static void main (String[] args) {
Scanner scnr = new Scanner (System.in);
Arraylist<String> userIDList = new ArrayList<String> ();
String userID;
userID = 3cnr.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));
}
}
Transcribed Image Text:7.16 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
318446.2220060.qx3zqy7
LAB
7.16.1: LAB: Sorting user IDs
0/ 10
АСTIVITY
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 2 images
Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education