CODE USING C++4. Find the Elephantby CodeChum AdminWhen dealing with problems, it is always best to find the "elephant" in the room. The elephant is basically the biggest issue. Once this is resolved, it's almost always easier to move forward. As a therapist, I know how to find the elephant in the room. However, I'm feeling sick today and the next client is coming. Could you please find the elephant for me? Instructions:In the code editor, you are provided with a function, findElephant() that accepts a 2D array and returns the largest element in the array. This function has already been implemented so do not edit this.You are also provided with the 2D array in the main() function.Your only task is to call the findElephant() function and pass the 2D array, and print the return value.OutputElephant:·10 EDIT THIS CODE: #include <iostream>#include <climits>using namespace std;int findElephant(int[][100]);int main(void) { 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 0;}// NOTE: DO NOT EDIT THIS FUNCTIONint findElephant(int arr[][100]) { int largest = INT_MIN; for(int row = 0; row < 100; row++) { for(int col = 0; col < 100; col++) { if(arr[row][col] > largest) { largest = arr[row][col]; } } } return largest;} main.cpp< > + C+4. Find the Elephant1 #include by CodeChum Admin2 #include using namespace std;When dealing with problems, it is always best to find the "elephant" in the room. The4elephant is basically the biggest issue.5 int findElephant(int[][100]);Once this is resolved, it's almost always easier to move forward.7 int main(void) {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, 1өө, 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},};8.As a therapist, I know how to find the elephant in the room. However, I'm feeling sicktoday and the next client is coming. Could you please find the elephant for me?101112Instructions:13141. In the code editor, you are provided with a function, findElephant () thataccepts a 2D array and returns the largest element in the array. This functionhas already been implemented so do not edit this.172. You are also provided with the 2D array in the main() function.183. Your only task is to call the findElephant () function and pass the 2D array,1920and print the return value.21return 0;22 }23Output24 // NOTE: DO NOT EDIT THIS FUNCTION25 int findElephant (int arr[][100]) {int largest = INT_MIN;26Elephant: 102728for (int row - 0; row < 100; row++) {29for (int col = 0; col < 100; col++) {if(arr[row][col] > largest) {largest = arr[row][col];}3031323334}3536return largest;37 }567 00

We can pass 2D array in function and this will be function call. Function call will be:…

CODE USING C++ 4. Find the Elephant by CodeChum Admin When dealing with problems, it is always best to find the "elephant" in the room. The elephant is basically the biggest issue. Once this is resolved, it's almost always easier to move forward. As a therapist, I know how to find the elephant in the room. However, I'm feeling sick today and the next client is coming. Could you please find the elephant for me? Instructions: In the code editor, you are provided with a function, findElephant() that accepts a 2D array and returns the largest element in the array. This function has already been implemented so do not edit this. You are also provided with the 2D array in the main() function. Your only task is to call the findElephant() function and pass the 2D array, and print the return value. Output Elephant:·10 EDIT THIS CODE: #include #include using namespace std; int findElephant(int[][100]); int main(void) { 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 0; } // NOTE: DO NOT EDIT THIS FUNCTION int findElephant(int arr[][100]) { int largest = INT_MIN; for(int row = 0; row < 100; row++) { for(int col = 0; col < 100; col++) { if(arr[row][col] > largest) { largest = arr[row][col]; } } } return largest;

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

See similar textbooks

4. Find the Elephant

by CodeChum Admin

When dealing with problems, it is always best to find the "elephant" in the room. The elephant is basically the biggest issue.

Once this is resolved, it's almost always easier to move forward.

As a therapist, I know how to find the elephant in the room. However, I'm feeling sick today and the next client is coming. Could you please find the elephant for me?

Instructions:

In the code editor, you are provided with a function, findElephant() that accepts a 2D array and returns the largest element in the array. This function has already been implemented so do not edit this.
You are also provided with the 2D array in the main() function.
Your only task is to call the findElephant() function and pass the 2D array, and print the return value.

Output

Elephant:·10

EDIT THIS CODE:

#include <iostream>
#include <climits>
using namespace std;

int findElephant(int[][100]);

int main(void) {
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 0;
}

// NOTE: DO NOT EDIT THIS FUNCTION
int findElephant(int arr[][100]) {
int largest = INT_MIN;

for(int row = 0; row < 100; row++) {
for(int col = 0; col < 100; col++) {
if(arr[row][col] > largest) {
largest = arr[row][col];
}
}
}

return largest;
}

main.cpp
< > + C+
4. Find the Elephant
1 #include <iostream>
by CodeChum Admin
2 #include <climits>
using namespace std;
When dealing with problems, it is always best to find the "elephant" in the room. The
4
elephant is basically the biggest issue.
5 int findElephant(int[][100]);
Once this is resolved, it's almost always easier to move forward.
7 int main(void) {
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, 1өө, 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},
};
8.
As a therapist, I know how to find the elephant in the room. However, I'm feeling sick
today and the next client is coming. Could you please find the elephant for me?
10
11
12
Instructions:
13
14
1. In the code editor, you are provided with a function, findElephant () that
accepts a 2D array and returns the largest element in the array. This function
has already been implemented so do not edit this.
17
2. You are also provided with the 2D array in the main() function.
18
3. Your only task is to call the findElephant () function and pass the 2D array,
19
20
and print the return value.
21
return 0;
22 }
23
Output
24 // NOTE: DO NOT EDIT THIS FUNCTION
25 int findElephant (int arr[][100]) {
int largest = INT_MIN;
26
Elephant: 10
27
28
for (int row - 0; row < 100; row++) {
29
for (int col = 0; col < 100; col++) {
if(arr[row][col] > largest) {
largest = arr[row][col];
}
30
31
32
33
34
}
35
36
return largest;
37 }
567 00

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Follow-up Questions

Read through expert solutions to related follow-up questions below.

Follow-up Question

The output must be Elephant: 10 not 632.

Solution

by Bartleby Expert

SEE SOLUTION

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.