Give a recursive algorithm in pseudocode that finds the maxi

Give a recursive algorithm in pseudocode that finds the maximum number among n integers. What is the time complexity of your algorithm?

Solution

def is palindrome(String):

i = -1

num = 0

String.split()

for char in string:

if char ==string[-1]

num +=1

if num ==len(String):

return True

else:

return False

time complexity: o(n)