CODE USING C++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.OutputElephant:·10 main.cpp4. Find the Elephantby CodeChum Admin1 #include 2 #include When dealing with problems, it is always best to find the3 using namespace std;4"elephant" in the room. The elephant is basically the5 int findElephant (int[][100]);biggest issue.7 int main(void) {Once this is resolved, it's almost always easier to moveint 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},};8{forward.10As a therapist, I know how to find the elephant in the1112room. However, I'm feeling sick today and the next client13is coming. Could you please find the elephant for me?1415Instructions:16171. In the code editor, you are provided with a function,18findElephant() that accepts a 2D array and19returns the largest element in the array. This20function has already been implemented so do not21edit this.22return 0;2. You are also provided with the 2D array in the23 }24main() function.3. Your only task is to call the findElephant ()25 // NOTE: DO NOT EDIT THIS FUNCTION26 int findElephant (int arr[][100]) {int largest = INT_MIN;function and pass the 2D array, and print the return27value.28for(int row = 0; row < 100; row++) {for (int col = 0; col < 100; col++) {if(arr[row][col] > largest) {2930Output3132largest = arr[row][col];}}}3334Elephant: 10353637return largest;38 }

We can call a 2D array by: function_name(array_name); Example: findElephant(matrix);

CODE USING C++ 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

CODE USING C++ 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

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 15RQ

See similar textbooks

Similar questions

Please Help me with This Problem Language = C++ Write a Menu Driven C++ program that creates a two-dimensional array/Matrix of size n X m where nrepresent the students and m represent the subjects and initialize it with user. The program should dofollowing Tasks using Menu, the menu operations are implemented using functions:a) Total_Marks: Calculates total/sum of the values in the specified row (student).b) Avg_Subject: Calculates Average of the values in the specified column (subject).c) Stud_Highest: Finds highest value in the specified row of the array and return that subjectname.d) Stud_Lowest: Finds lowest value in the specified row of the array and return that subject name.
def large_matrix(matrix: list[list[int]]) -> int:"""Returns the area of the rectangle in the area of a rectangle is defined by number of 1's that it contains.The matrix will only contain the integers 1 and 0.>>> case = [[1, 0, 1, 0, 0],... [1, 0, 1, 1, 1],... [1, 1, 1, 1, 1],... [1, 0, 0, 1, 0]]>>> largest_in_matrix(case1)6"" You must use this helper code: def large_position(matrix: list[list[int]], row: int, col: int) -> int: a = rowb = colmax = 0temp = 0rows = len(matrix)column = len(matrix[a])while a < rows and matrix[a][col] == 1:temp = 0while b < column and matrix[a][b] == 1:temp = temp + 1b = b + 1column = ba = a + 1if (a != row+1):temp2 = temp * (a - row)else:temp2 = tempif max < temp2:max = temp2b = colreturn max """ remember: Please do this on python you should not use any of the following: dictionaries or dictionary methods try-except break and continue statements recursion map / filter import""'
AHPA #11: Changing Grades *use c programming language * Create a C function (switcher) that will receive a pointer to the finalExams array, using only pointers look for D scores and boost them to C scores. (ouput should be same as picture) #include <stdio.h> void switcher() { } int main(void) { int finalExams[] = {90,82,65,79,67,82,94,64,88,78,92,61,96,83,74}; return 0;}
OOP using C++ please give me full answer thanks : A designer in 3D graphics company wants to design a matrix as a two-dimensional array. The size of 2D array could be the last two digit of arid number. Initially he creates a class matrix that provides the member function to check that no array index is out of bounds. Make the member data in the matrix class a 10-by-10 array. A constructor should allow the programmer to specify the actual dimensions of the matrix (provided they’re less than 10 by 10). The member functions that access data in the matrix will now need two index numbers: one for each dimension of the array. Here’s what a fragment of a main() program that operates on such a class might look like: If my Arid Number is 20-Arid-254 then: // in case of zero consider next digit matrix m1(5, 4); // define a matrix object int temp = 12345; // define an int value m1.putel(7, 4, temp); // insert value of temp into matrix at 7,4 temp = m1.getel(7, 4); // obtain value from…
javascript Define a function, myIncludes, that accepts two parameters: an array and a searchValue. myIncludes should return true if the searchValue is an element in the array. Otherwise, myIncludes should return false. example myIncludes([10, 20, 30], 20); // => true myIncludes(['apples', 'bananas', 'citrus'], 'pears'); // => false
assembly language ctt 9. Counting Nearly Matching ElementsWrite a procedure named CountNearMatches that receives pointers to two arrays of signed doublewords, a parameter that indicates the length of the two arrays, and a parameter that indicates the maximum allowed difference (called diff) between any two matching elements. For each element x(i) in the ﬁrst array, if the difference between it and the corresponding y(i) in the second array is less than or equal to diff, increment a count. At the end, return a count of the number of nearly matching array elements in EAX. Display this value. Write a test program that calls CountNearMatches and passes pointersto two different pairs of arrays. Use the INVOKE statement to call your procedure and pass stackparameters. Create a PROTO declaration for CountMatches. Save and restore any registers (other than EAX) changed by your procedure.
Language: JAVA Script write a function 'keyValueDuplicates (obj) that takes an object as an argument and returns an array containing all keys that are also values in that object. Examples: obj1 = { orange: "juice", apple: "sauce", sauce: "pan" }; console.log(keyValueDuplicates (obj1)); // ["sauce"] obj2 = { big: "foot", foot: "ball", ball: "boy", boy: "scout"};console.log(keyValueDuplicates(obj2)); // ["foot", "ball", "boy"] obj3 = { pizza: "pie", apple: "pie" pumpkin: "pie"); console.log(keyValueDuplicates (obj3)); // [] *******************************************************************/function keyValueDuplicates (obj) { | // Your code here } /*****DO NOT MODIFY ANYTHING UNDER THIS LINE*********/ try { | module.exports = keyValueDuplicates; } catch (e) { | module.exports = null;}
def large_position(matrix: list[list[int]], row: int, col: int) -> int: """ Returns the area of the largest rectangle whose top left corner is at position <row>, <col> in <matrix>. You MUST make use of the helper <longest_chain> here as you loop through each row of the matrix. Do not modify (i.e., mutate) the input matrix. >>> case = [[1, 0, 1, 0, 0], ... [1, 0, 1, 1, 1], ... [1, 1, 1, 1, 1], ... [1, 0, 0, 1, 0]] >>> large_position(case1, 0, 0) 4 """ You must refer to this while writing for the code above Helper: def longest_chain(lst: List[int]) -> int: count = 0 i = 0while (i < len(lst) and lst[i] != 0): i += 1 count += 1 return count """ Please do this on python you should not use any of the following: dictionaries or dictionary methods try-except break and continue statements recursion map / filter import ""'
C++ Language C++ Code not working, what is the missing piece in this code? #include <iostream>#include <string>#include <vector>#include <stack>using namespace std; int main(){string x;stack < char, vector<char> > iStack;boolean status=true; cout << "Enter series of parentheses: ";getline(cin, x);for (int i=0; i<x.length(); i++)//measure the length of the string inputif (x[i] == '(' || x[i] == '{' || x[i] == '[')iStack.push(x[i]);else{ //if not opening grouping symbolif(x[i] == ']') {if(iStack.isEmpty() || iStack.top() != '[') {return false;}} else if (x[i] == ')') {if(iStack.isEmpty() || iStack.top() != '(') {return false;}} else if (x[i] == '}') {if(iStack.isEmpty() || iStack.top() != '{') {return false;} }iStack.pop();} if (iStack.empty())cout << "Balance!" << endl;elsecout << "Not Balance!" << endl;}
Please complete the following guidelines and hints. Using C language. Please use this template: #include <stdio.h>#define MAX 100struct cg { // structure to hold x and y coordinates and massfloat x, y, mass;}masses[MAX];int readin(void){/* Write this function to read in the datainto the array massesnote that this function should return the number ofmasses read in from the file */}void computecg(int n_masses){/* Write this function to compute the C of Gand print the result */}int main(void){int number;if((number = readin()) > 0)computecg(number);return 0;}Testing your workTypical Input from keyboard:40 0 10 1 11 0 11 1 1Typical Output to screen:CoG coordinates are: x = 0.50 y = 0.50
Task- Median elements (C Language) Example #4 expected output is 5, but from the program below its coming out to 4. Please help make it come out to 5 as expected Given an array of integer elements, the median is the value that separates the higher half from the lower half of the values. In other words, the median is the central element of a sorted array. Since multiple elements of an input array can be equal to the median, in this task you are asked to compute the number of elements equal to the median in an input array of size N, with N being an odd number. Requirements Name your program project4_median.c. Follow the format of the examples below. The program will read the value of N, then read in the values that compose the array. These values are not necessarily sorted. The program should include the following function. Do not modify the function prototype. int compute_median(int *a, int n); a represents the input array, n is the length of the array. The function returns the…
Final review ch6-7 C language Using arrays create a personal phone directory that contains room for first names and phone numbers for 20 people. Using the "names.txt" retrieve the first name and phone number for each person and store in arrays (parallel). Prompt the user for a name, search for the name, and if name is found in the array, display the corresponding phone number. If the name is not found, prompt the user to enter a phone number, and add the new name and phone number to the list. Continue to prompt the user for names until the user enters quit or until arrays are full. After the arrays are full (containing 20 names), do not allow the user to add new entries. Print the full list. "names.txt" Denton (123)-456-7890 Francis (123)-456-7891 Lucy (123)-456-7892 Brooklyn (123)-456-7899 Mattie (123)-456-7898 Clarissa (123)-456-7897 Bailey (123)-456-7896 Lesley (123)-456-7895 Tristan (123)-456-7894 Bethany (123)-456-7893