Start with this class declaration: class Student { int sId; String name; double gpa; } Implement a Comparable and Comparator interface to provide the following three (3) alternative ways of ordering for the Student objects - based on sId (i.e., assume that this is selected as the natural ordering) - based on name, - based on gpa. Next declare a list of five Student objects, initialize them with random values. Test your code by printing out each of the following on separate lines: (original list of students, sorted list of students in ascending sId order, sorted list of students in ascending name order, sorted list of students in ascending gpa order).
Start with this class declaration: class Student { int sId; String name; double gpa; } Implement a Comparable and Comparator interface to provide the following three (3) alternative ways of ordering for the Student objects - based on sId (i.e., assume that this is selected as the natural ordering) - based on name, - based on gpa. Next declare a list of five Student objects, initialize them with random values. Test your code by printing out each of the following on separate lines: (original list of students, sorted list of students in ascending sId order, sorted list of students in ascending name order, sorted list of students in ascending gpa order).
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter13: Overloading And Templates
Section: Chapter Questions
Problem 20PE
Related questions
Question
Start with this class declaration:
class Student {
int sId;
String name;
double gpa;
}
Implement a Comparable and Comparator interface to provide the following three (3) alternative ways of ordering for the Student objects
- based on sId (i.e., assume that this is selected as the natural ordering)
- based on name,
- based on gpa.
Next declare a list of five Student objects, initialize them with random values. Test your code by printing out each of the following on separate lines: (original list of students, sorted list of students in ascending sId order, sorted list of students in ascending name order, sorted list of students in ascending gpa order).
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT