#최대값, 최소값 구하는 알고리즘
#Max
list =[9, 22, 3, 7, 4, 5]
# O(n)
def solution(list):
result = list[0]
for num in list[1:]:
if result < num:
result = num
print(num, result)
return result
print("=>", solution(list))
def solution2(list):
result = list[0]
for i in range(1,len(list)):
num = list[i]
#print(i, num)
if result < num:
result = num
return result
print("=>", solution2(list))
#Min
def min(list):
result = list[0]
for num in list[1:]:
if result > num:
result = num
print(num, result)
return result
print("min =>", min(list))
def min2(list):
result = list[0]
for i in range(1, len(list)):
num = list[i]
if result > num:
result = num
print(num, result)
return result
print("min =>", min2(list))