LISTING 7.10 BinarySearch.cpp int binarySearch(const int list[], int key, int listSize) 2 { 1 3 int low = 0; 4 int high = listSize 1; %3D while (high >= low) 7 (low + high) / 2; list[mid]) mid - 1; 8 int mid if (key high else if (key return mid; else low 10 11 list[mid]) 3D%3D 12 13 mid + 1; 16 456

Exercise - Collection Functions Using the code below, use the map function to create an array of Int values, whose values are equal to the original integer value, plus 1. Use $0 as you iterate through the values of the array. Print the resulting collection. 5 let testScores = [65, 80, 88, 90, 47] Using the code below, use the filter function to create a new array of String values. The new array should only include Strings longer than four characters. Use $0 as you iterate through the values of the array. Print the resulting collection. Olet schoolSubjects = ["Math" , "Computer Science", "Gym", "English", "Biology"] Using the code below, use the reduce function to subtract all of the values within the array from the starting value 100. Print the resulting value. let damageTaken = [25, 10, 15, 30, 20]

///////1/////. Given an array of integers, write a PHP function to find the maximum element in the array. PHP Function Signature: phpCopy code function findMaxElement($arr) { // Your code here } Example: Input: [10, 4, 56, 32, 7] Output: 56 You can now implement the findMaxElement function to solve this problem. Let me know answer. //. .

Use pointers to write a function that finds the larg- est element in an array of integers. Use {6, 7, 9, 10, 15, 3, 99, -21} to test the function.