Max-Min Problem

Algorithm: Max - Min(x, y) 
if |x – y| ≤ 1 then  
   return (max(numbers[x], numbers[y]), min((numbers[x], numbers[y])) 
else 
   (max1, min1):= maxmin(x, ⌊((x + y)/2)⌋) 
   (max2, min2):= maxmin(⌊((x + y)/2) + 1)⌋,y) 
return (max(max1, max2), min(min1, min2))

DAA - Max-Min Problem

import math
arr = [1,52,23,99,23,121,234,9,0,5,2]
def max_min(x, y):
	if abs(x-y)<=1:
		return (max(arr[x], arr[y]), min(arr[x], arr[y]))
	else:
		(max1, min1) = max_min(x, math.floor((x+y)/2))
		(max2, min2) = max_min(math.floor((x+y)/2+1), y)
		return (max(max1, max2), min(min1, min2))
print(max_min(0, 10))