Give the pseudocode and java code for a recursive algorithm that finds the maximum element in an array A of n elements.

Please show and explain so I can nderstand.

Using recursion, segregate an array of integers to have the even integers come before the odd using C++

With the Binary Search algorithm, the algorithm can be developed by the loop-based form as well as a recursive form. Which of the following is not true? O If the item is not found, the loop version returns when the range bounds reach, but the recursive version finishes when the recursive depth is more than half the initial search range. The search range starts with the whole array, and only the recursive version can work on a subrange passed through arguments. O Both forms of the program divide the search range repeatedly in half. O If the item is found, the loop version returns from the entire method, whereas the recursive version returns from one level of recursion.