def findMinMax(L):
l=len(L)
if l==0:
return(None,None)
else:
min=L[0]
max=L[0]
n=0
for x in L:
while(n<l):
if L[n]>max:
max=L[n]
if L[n]<min:
min=L[n]
n=n+1
return(min,max)
print(findMinMax([]))
print(findMinMax([7]))
print(findMinMax([7,1]))
print(findMinMax([7,1,3,9,5]))
JoyElaine
def findMinMax(L): l=len(L) if l==0: return(None,None) else: min=L[0] max=L[0] n=0 for x in L: while(n<l): if L[n]>max: max=L[n] if L[n]<min: min=L[n] n=n+1 return(min,max) print(findMinMax([])) print(findMinMax([7])) print(findMinMax([7,1])) print(findMinMax([7,1,3,9,5]))
(None, None) (7, 7) (1, 7) (1, 9)