Question

DETAILED PSEUDOCODE WITH EXPLANATION OR FLOWGORITHM NEEDED. (It's all I'm familiar with at this time)

Design a function that accepts an array and the array's size as arguments, and returns the largest value in the array. The method should use recursion to find the largest element.

Answer 1

/*
   Function that accepts an array and the array's size as arguments, and returns the largest value in the array.
   Pre-condition : array must be atleast of size 1
   Post-condition : returns the largest element of the array
   array : array of number which starts from 0,1,..,size-1
   size : number of elements in the array
*/

function getLargest(number array[], number size)
   // base condition : if size of array is 1, return it
   if(size ==1 ) then
       return array[0]; // since array index starts from 0, we access the element using size-1
   end if;
  
   // recursive condition
   // get the largest element of the array from 0,1,..,size-1
   int largest = getLargest(array,size-1); // return the largest element from the sub-array from [0,size-1)
  
   // if the largest element obtained from the array from [0,size-1) is less than element at array[size-1]
   // then return the element at array[size-1]
   if(largest < array[size-1]) then
       return array[size-1];
   else // else return largest
       return largest;
      
end getLargest ;