27 lines
503 B
Python
27 lines
503 B
Python
import random
|
|
|
|
numsTest = [1, 2, 3, 4, 5]
|
|
|
|
def search_min(nums):
|
|
if len(nums) == 1:
|
|
return nums[0]
|
|
|
|
num = nums[0]
|
|
nums.remove(num)
|
|
|
|
# n-1 recursions
|
|
rec_num = search_min(nums)
|
|
|
|
if rec_num < num:
|
|
return rec_num
|
|
else:
|
|
# n-1 times called in worst case
|
|
smaller = True
|
|
for n in nums:
|
|
if n <= num:
|
|
smaller = False
|
|
print('Hit')
|
|
assert smaller == True
|
|
return num
|
|
|
|
print(search_min(numsTest)) |