Sort students) Rewrite Programming Exercise 7.17 using streams. Define a class named Student with data fields name and score and their getter methods. Store each student in a Student object. package Exercise_30_9; import java.util.Scanner; public class Original { publicstaticvoidmain(String[] args) { Scannerinput = newScanner(System.in); System.out.print("Please enter the number of students:"); intnumStudents = input.nextInt(); double[] scores = newdouble[numStudents]; String[] names = newString[numStudents]; for (inti = 0; i < names.length; i++) { System.out.print("Enter a student name:"); names[i] = input.next(); System.out.print("Enter the students score:"); scores[i] = input.nextDouble(); } sortArray(scores, names); System.out.println("The student names in decreasing order of their scores are: "); for (inti = 0; i < scores.length; i++) { System.out.println(names[i] + " " + scores[i]); } } publicstaticvoidsortArray(double[] arr, String[] array) { for (inti = 0; i < arr.length; i++) { doublecurrentMax = arr[i]; intcurrentIndex = i; Stringtemp; for (intj = i + 1; j < arr.length; j++) { if (arr[j] > currentMax) { currentMax = arr[j]; currentIndex = j; } } if (currentIndex != i) { temp = array[i]; array[i] = array[currentIndex]; array[currentIndex] = temp; arr[currentIndex] = arr[i]; arr[i] = currentIndex; } } } }
Sort students) Rewrite Programming Exercise 7.17 using streams. Define a class named Student with data fields name and score and their getter methods. Store each student in a Student object. package Exercise_30_9; import java.util.Scanner; public class Original { publicstaticvoidmain(String[] args) { Scannerinput = newScanner(System.in); System.out.print("Please enter the number of students:"); intnumStudents = input.nextInt(); double[] scores = newdouble[numStudents]; String[] names = newString[numStudents]; for (inti = 0; i < names.length; i++) { System.out.print("Enter a student name:"); names[i] = input.next(); System.out.print("Enter the students score:"); scores[i] = input.nextDouble(); } sortArray(scores, names); System.out.println("The student names in decreasing order of their scores are: "); for (inti = 0; i < scores.length; i++) { System.out.println(names[i] + " " + scores[i]); } } publicstaticvoidsortArray(double[] arr, String[] array) { for (inti = 0; i < arr.length; i++) { doublecurrentMax = arr[i]; intcurrentIndex = i; Stringtemp; for (intj = i + 1; j < arr.length; j++) { if (arr[j] > currentMax) { currentMax = arr[j]; currentIndex = j; } } if (currentIndex != i) { temp = array[i]; array[i] = array[currentIndex]; array[currentIndex] = temp; arr[currentIndex] = arr[i]; arr[i] = currentIndex; } } } }
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
(Sort students) Rewrite Programming Exercise 7.17 using streams. Define a class named Student with data fields name and score and their getter methods. Store each student in a Student object.
package Exercise_30_9;
import java.util.Scanner;
public class Original {
publicstaticvoidmain(String[] args) {
Scannerinput = newScanner(System.in);
System.out.print("Please enter the number of students:");
intnumStudents = input.nextInt();
double[] scores = newdouble[numStudents];
String[] names = newString[numStudents];
for (inti = 0; i < names.length; i++) {
System.out.print("Enter a student name:");
names[i] = input.next();
System.out.print("Enter the students score:");
scores[i] = input.nextDouble();
}
sortArray(scores, names);
System.out.println("The student names in decreasing order of their scores are: ");
for (inti = 0; i < scores.length; i++) {
System.out.println(names[i] + " " + scores[i]);
}
}
publicstaticvoidsortArray(double[] arr, String[] array) {
for (inti = 0; i < arr.length; i++) {
doublecurrentMax = arr[i];
intcurrentIndex = i;
Stringtemp;
for (intj = i + 1; j < arr.length; j++) {
if (arr[j] > currentMax) {
currentMax = arr[j];
currentIndex = j;
}
}
if (currentIndex != i) {
temp = array[i];
array[i] = array[currentIndex];
array[currentIndex] = temp;
arr[currentIndex] = arr[i];
arr[i] = currentIndex;
}
}
}
}
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 3 steps with 3 images
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
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