4. Assuming you have initialized the heightWeight array from the previous question like this: double [] [] heightWeight = new double [25] [2]; = heightWeight [0][0] = 6.4; //height heightWeight [0] [1] 270.0; // weight How would you find out which player is the tallest? A. int tallest_index = 0; C. int tallest_index = 0; for (int i = 1; i < 25; i++) { for (int i = 1; i < 25; i++) { if (heightWeight[i][0]> heightWeight[tallest_index][0]) tallest_index = i; if (height Weight[i][0]> heightWeight[i-1][0]) tallest_index = i; } } System.out.println("The tallest player is at index" + tallest_index); System.out.println("The tallest player is at index " + tallest_index); B. int tallest_index = 0; D. int tallest_index = 0; for (int i = 1; i <= 25; i++) { for (int i = 1; i < 2; i++) { if (heightWeight[i][0]> heightWeight[tallest_index][0]) for (int j = 0; j < 25; j++){ tallest_index = i; if (height Weight[i][j]> heightWeight[tallest_index][j]) } tallest_index = i; System.out.println("The tallest player is at index" + tallest_index); } } System.out.println("The tallest player is at index " + tallest_index);
4. Assuming you have initialized the heightWeight array from the previous question like this: double [] [] heightWeight = new double [25] [2]; = heightWeight [0][0] = 6.4; //height heightWeight [0] [1] 270.0; // weight How would you find out which player is the tallest? A. int tallest_index = 0; C. int tallest_index = 0; for (int i = 1; i < 25; i++) { for (int i = 1; i < 25; i++) { if (heightWeight[i][0]> heightWeight[tallest_index][0]) tallest_index = i; if (height Weight[i][0]> heightWeight[i-1][0]) tallest_index = i; } } System.out.println("The tallest player is at index" + tallest_index); System.out.println("The tallest player is at index " + tallest_index); B. int tallest_index = 0; D. int tallest_index = 0; for (int i = 1; i <= 25; i++) { for (int i = 1; i < 2; i++) { if (heightWeight[i][0]> heightWeight[tallest_index][0]) for (int j = 0; j < 25; j++){ tallest_index = i; if (height Weight[i][j]> heightWeight[tallest_index][j]) } tallest_index = i; System.out.println("The tallest player is at index" + tallest_index); } } System.out.println("The tallest player is at index " + tallest_index);
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
Q4
![4. Assuming you have initialized the heightWeight array from the previous question
like this:
double [] [] heightWeight = new double [25] [2];
heightWeight [0][0]
=
6.4; //height heightWeight [0] [1]
=
270.0; // weight
How would you find out which player is the tallest?
A.
int tallest_index = 0;
C.
int tallest_index = 0;
for (int i = 1; i < 25; i++) {
for (int i = 1; i < 25; i++) {
if
(heightWeight[i][0] > heightWeight[tallest_index][0])
tallest_index = i;
if (height Weight[i][0]> heightWeight[i-1][0])
tallest_index = i;
}
}
System.out.println("The tallest player is at index" + tallest_index);
System.out.println("The tallest player is at index " + tallest_index);
B. int tallest_index = 0;
D.
int tallest_index = 0;
for (int i = 1; i <= 25; i++) {
for (int i = 1; i < 2; i++) {
if (heightWeight[i][0]> height Weight[tallest_index][0])
for (int j = 0; j < 25; j++){
tallest_index = i;
if (height Weight[i][j]> heightWeight[tallest_index][j])
}
tallest_index = i;
System.out.println("The tallest player is at index " + tallest_index);
}
}
System.out.println("The tallest player is at index" + tallest_index);](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F6cf78908-a1f9-4330-9ece-f4021df10613%2F886ab388-f51b-4579-a926-d071dd0d39a9%2Fk36jw7_processed.png&w=3840&q=75)
Transcribed Image Text:4. Assuming you have initialized the heightWeight array from the previous question
like this:
double [] [] heightWeight = new double [25] [2];
heightWeight [0][0]
=
6.4; //height heightWeight [0] [1]
=
270.0; // weight
How would you find out which player is the tallest?
A.
int tallest_index = 0;
C.
int tallest_index = 0;
for (int i = 1; i < 25; i++) {
for (int i = 1; i < 25; i++) {
if
(heightWeight[i][0] > heightWeight[tallest_index][0])
tallest_index = i;
if (height Weight[i][0]> heightWeight[i-1][0])
tallest_index = i;
}
}
System.out.println("The tallest player is at index" + tallest_index);
System.out.println("The tallest player is at index " + tallest_index);
B. int tallest_index = 0;
D.
int tallest_index = 0;
for (int i = 1; i <= 25; i++) {
for (int i = 1; i < 2; i++) {
if (heightWeight[i][0]> height Weight[tallest_index][0])
for (int j = 0; j < 25; j++){
tallest_index = i;
if (height Weight[i][j]> heightWeight[tallest_index][j])
}
tallest_index = i;
System.out.println("The tallest player is at index " + tallest_index);
}
}
System.out.println("The tallest player is at index" + tallest_index);
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
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