python-programming-exercises-gently-explained/Exercise12.py at main · aslanyrahim/python-programming-exercises-gently-explained · GitHub

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
# Version 1 - while loop
# def getSmallest(number):
#     if len(number) == 0:
#         return None

#     i = 0
#     smallest = number[0]
#     while i < len(number):
#         if number[i] < smallest:
#             smallest = number[i]
#         i += 1
#     return smallest

# def getBiggest(number):
#     if len(number) == 0:
#         return None

#     i = 0
#     biggest = number[0]
#     while i < len(number):
#         if number[i] > biggest:
#             biggest = number[i]
#         i += 1
#     return biggest

# Version 2 - for loop
def getSmallest(number):
    if len(number) == 0:
        return None

    smallest = number[0]
    for n in number:
        if n < smallest:
            smallest = n
    return smallest


def getBiggest(number):
    if len(number) == 0:
        return None

    biggest = number[0]
    for n in number:
        if n > biggest:
            biggest = n
    return biggest


assert getSmallest([1, 2, 3]) == 1

assert getSmallest([3, 2, 1]) == 1

assert getSmallest([28, 25, 42, 2, 28]) == 2

assert getSmallest([1]) == 1

assert getSmallest([]) == None