pseudocode divide and conquer largest and smallest
write a pseudocode for divide-and-conquer algorithm for finding the values of both the largest and smallest elements in an array of n numbers.
algorithm largestSmallest(numbers[1..n]) -> (smallest, largest)
if (n == 1)
return (A, A)
else if (n ==