Python/maths/find_min.py at master · TheAlgorithms/Python · GitHub

Name: Python/maths/find_min.py at master · TheAlgorithms/Python · GitHub
Rating: 4.9 (2293 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
from __future__ importannotations


deffind_min_iterative(nums: list[int|float]) ->int|float:
"""
 Find Minimum Number in a List
 :param nums: contains elements
 :return: min number in list

 >>> for nums in ([3, 2, 1], [-3, -2, -1], [3, -3, 0], [3.0, 3.1, 2.9]):
 ... find_min_iterative(nums) == min(nums)
 True
 True
 True
 True
 >>> find_min_iterative([0, 1, 2, 3, 4, 5, -3, 24, -56])
 -56
 >>> find_min_iterative([])
 Traceback (most recent call last):
 ...
 ValueError: find_min_iterative() arg is an empty sequence
 """
iflen(nums) ==0:
raiseValueError("find_min_iterative() arg is an empty sequence")
min_num=nums[0]
fornuminnums:
min_num=min(min_num, num)
returnmin_num


# Divide and Conquer algorithm
deffind_min_recursive(nums: list[int|float], left: int, right: int) ->int|float:
"""
 find min value in list
 :param nums: contains elements
 :param left: index of first element
 :param right: index of last element
 :return: min in nums

 >>> for nums in ([3, 2, 1], [-3, -2, -1], [3, -3, 0], [3.0, 3.1, 2.9]):
 ... find_min_recursive(nums, 0, len(nums) - 1) == min(nums)
 True
 True
 True
 True
 >>> nums = [1, 3, 5, 7, 9, 2, 4, 6, 8, 10]
 >>> find_min_recursive(nums, 0, len(nums) - 1) == min(nums)
 True
 >>> find_min_recursive([], 0, 0)
 Traceback (most recent call last):
 ...
 ValueError: find_min_recursive() arg is an empty sequence
 >>> find_min_recursive(nums, 0, len(nums)) == min(nums)
 Traceback (most recent call last):
 ...
 IndexError: list index out of range
 >>> find_min_recursive(nums, -len(nums), -1) == min(nums)
 True
 >>> find_min_recursive(nums, -len(nums) - 1, -1) == min(nums)
 Traceback (most recent call last):
 ...
 IndexError: list index out of range
 """
iflen(nums) ==0:
raiseValueError("find_min_recursive() arg is an empty sequence")
if (
left>=len(nums)
orleft<-len(nums)
orright>=len(nums)
orright<-len(nums)
 ):
raiseIndexError("list index out of range")
ifleft==right:
returnnums[left]
mid= (left+right) >>1# the middle
left_min=find_min_recursive(nums, left, mid) # find min in range[left, mid]
right_min=find_min_recursive(
nums, mid+1, right
 ) # find min in range[mid + 1, right]

returnleft_minifleft_min<=right_minelseright_min


if__name__=="__main__":
importdoctest

doctest.testmod(verbose=True)