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);
Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter9: Advanced Modularization Techniques
Section: Chapter Questions
Problem 1GZ
Related questions
Question
Q4
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
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
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
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
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