has already been implemented so do not edit this. 2. You are also provided with the 2D array in the main() function. 3. Your only task is to call the findElephant() function and pass the 2D array, and print the return value. Output Elephant: 10
has already been implemented so do not edit this. 2. You are also provided with the 2D array in the main() function. 3. Your only task is to call the findElephant() function and pass the 2D array, and print the return value. Output Elephant: 10
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![main.c
+ c
{3, 24, ´101, 331, 542,´65,´32, 239, 338, 175},
{76, 3, 59, 21, 229, 65, 32, 28, 98, 75},
};
16
17
18
19
20
21
return 0;
22 }
23
24
// NOTE: D0 NOT EDIT THIS FUNCTION
25 - int findElephant(int arrO[100]) {
int largest = INT_MIN;
26
27
28 -
for(int row =
0; row < 100; row++) {
for(int col = 0; col < 100; col++) {
if(arr[row][col] > largest) {
largest
}
}
29 -
30
31
arr[row][col];
32
33
34
}
35
36
return largest;
37 }](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F82304115-cf1d-40b3-864e-0ed64499952f%2F8b94e25c-5730-4be8-891c-648a322c23fc%2Fatx0bxe_processed.png&w=3840&q=75)
Transcribed Image Text:main.c
+ c
{3, 24, ´101, 331, 542,´65,´32, 239, 338, 175},
{76, 3, 59, 21, 229, 65, 32, 28, 98, 75},
};
16
17
18
19
20
21
return 0;
22 }
23
24
// NOTE: D0 NOT EDIT THIS FUNCTION
25 - int findElephant(int arrO[100]) {
int largest = INT_MIN;
26
27
28 -
for(int row =
0; row < 100; row++) {
for(int col = 0; col < 100; col++) {
if(arr[row][col] > largest) {
largest
}
}
29 -
30
31
arr[row][col];
32
33
34
}
35
36
return largest;
37 }
![has already been implemented so
main.c
+ с
do not edit this.
2. You are also provided with the 2D
1 #include<stdio.h>
array in the main() function.
2 #include<limits.h>
3. Your only task is to call the
4
int findElephant(int[][100]);
findElephant() function and
6 - int main(void) {
7 -
pass the 2D array, and print the
int matrix[100][100] = {
{1, 3, 33, 109, 2, 65, 32, 28, 129, 75},
{2, 44, 59, 8, 231, 632, 55, 205, 98, 1},
{76, 2, 321, 16, 209, 65, 12, 167, 259, 29},
{0, 103, 99, 3, 2, 65, 32, 321, 53, 75},
{44, 264, 50, 7, 142, 65, 100, 28, 98, 33},
{87, 22, 99, 67, 22, 412, 99, 502, 52, 24},
{91, 93, 233, 101, 330, 65, 98, 28, 98, 76},
{12, 65, 59, 99, 2, 65, 32, 333, 10, 88},
{3, 24, 101, 331, 542, 65, 32, 239, 338, 175},
{76, 3, 59, 21, 229, 65, 32, 28, 98, 75},
};
return value.
8
9.
10
Output
11
12
13
Elephant: 1ө
14
15
16
17
18
19](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F82304115-cf1d-40b3-864e-0ed64499952f%2F8b94e25c-5730-4be8-891c-648a322c23fc%2Fnpmuy3_processed.png&w=3840&q=75)
Transcribed Image Text:has already been implemented so
main.c
+ с
do not edit this.
2. You are also provided with the 2D
1 #include<stdio.h>
array in the main() function.
2 #include<limits.h>
3. Your only task is to call the
4
int findElephant(int[][100]);
findElephant() function and
6 - int main(void) {
7 -
pass the 2D array, and print the
int matrix[100][100] = {
{1, 3, 33, 109, 2, 65, 32, 28, 129, 75},
{2, 44, 59, 8, 231, 632, 55, 205, 98, 1},
{76, 2, 321, 16, 209, 65, 12, 167, 259, 29},
{0, 103, 99, 3, 2, 65, 32, 321, 53, 75},
{44, 264, 50, 7, 142, 65, 100, 28, 98, 33},
{87, 22, 99, 67, 22, 412, 99, 502, 52, 24},
{91, 93, 233, 101, 330, 65, 98, 28, 98, 76},
{12, 65, 59, 99, 2, 65, 32, 333, 10, 88},
{3, 24, 101, 331, 542, 65, 32, 239, 338, 175},
{76, 3, 59, 21, 229, 65, 32, 28, 98, 75},
};
return value.
8
9.
10
Output
11
12
13
Elephant: 1ө
14
15
16
17
18
19
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 3 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY