Question

follow the algorithm to find Smallest of the given numbers work stepwise and complete the table​

Answer 1

$\huge\red{\mid{\fbox{\tt{Using\: Python\: 3}}\mid}}$

def _min(nums):

_min = nums[0]

for n in nums:

if n < _min:

_min = n

return _min

print(_min((nums := list(map(int, input("nums: ").split())))))

$\large\mathsf\color{lightgreen}useful?\: \color{white}\longrightarrow\: \color{orange}brainliest!$

Answer 2

Answer:

def _min(nums):

_min = nums[0]

for n in nums:

if n < _min:

_min = n

return _min

print(_min((nums := list(map(int, input("nums: ").split())))))

\large\mathsf\color{lightgreen}useful?\: \color{white}\longrightarrow\: \color{orange}brainliest!