Given an array of integers your solution should find the smallest integer. 

For example:

- Given `[34, 15, 88, 2]` your solution will return `2`
- Given `[34, -345, -1, 100]` your solution will return `-345`

You can assume, for the purpose of this kata, that the supplied array will not be empty.

Source: codewars | Difficulty: EASY
Tags: Fundamentals

Starter code: def find_smallest_int(arr):
	

Solutions:
def find_smallest_int(arr):
	return min(arr)


def find_smallest_int(arr):
	return sorted(arr)[0]


find_smallest_int = min


def find_smallest_int(arr):
	smallest = min(arr)
	for i in arr:
		if i < min(arr):
			smallest = i
		return smallest


def find_smallest_int(arr):
	a = 10000
	for i in arr:
		if a > i:
			a = i
	return a


import sys

def find_smallest_int(arr):
	my_int = sys.maxsize
	for integer in arr:
		if integer < my_int:
			my_int = integer
	return my_int


import numpy

def find_smallest_int(arr):
	return numpy.min(arr)


def find_smallest_int(arr):
	currentSmallest = arr[0]
	for x in range(len(arr)):
		if currentSmallest > arr[x]:
			currentSmallest = arr[x]
	return currentSmallest


def find_smallest_int(arr):
	min_number = arr[0]
	for element in arr:
		if element < min_number:
			min_number = element
	return min_number


def find_smallest_int(arr):
	a = arr.sort()
	return arr[0]


def find_smallest_int(arr):
	arr.sort()
	return arr[0]
	return min(arr)

def find_smallest_int(arr):
	smallest = arr[0]
	for item in arr:
		if smallest > item:
			smallest = item
	return smallest


def find_smallest_int(arr):
	answer = arr[0]
	for nr in arr:
		if nr < answer:
			answer = nr
	return answer


def find_smallest_int(arr):
	return min(arr)
small = find_smallest_int([78, 56, 232, 12, 11, 43])
print(small)


from functools import reduce

def find_smallest_int(arr):
	return reduce(lambda a, b: min(a, b), arr)


from functools import reduce

def find_smallest_int(arr):
	return int(reduce(lambda x, y: y if y < x else x, arr))


import sys

def find_smallest_int(arr):
	smallest = sys.maxsize
	for i in range(len(arr)):
		if arr[i] < smallest:
			smallest = arr[i]
	return smallest


def find_smallest_int(a: list) -> int:
	return min(a)


def find_smallest_int(arr):
	min = arr[0]
	for i in range(len(arr)):
		if i + 1 < len(arr):
			if arr[i + 1] < min:
				min = arr[i + 1]
	return min


def find_smallest_int(arr):
	sortedlist = sorted(arr)
	result = sortedlist.__getitem__(0)
	return result


def find_smallest_int(arr):
	ans = arr[0]
	for x in arr:
		if x < ans:
			ans = x
	return ans


def find_smallest_int(arr):
	lowest = 10000
	for number in arr:
		if number < lowest:
			lowest = number
	return lowest


def find_smallest_int(arr):
	smallestInt = arr[0]
	for var in arr:
		if var < smallestInt:
			smallestInt = var
	return smallestInt


def find_smallest_int(arr):
	small = arr[0]
	for n in arr:
		if n < small:
			small = n
	return small


def find_smallest_int(arr):
	arr.sort()
	smol = arr[0:1]
	for i in smol:
		return i


def find_smallest_int(arr):
	smol = arr[0]
	for i in arr:
		if smol > i:
			smol = i
	return smol


def find_smallest_int(arr):
	print(arr)
	smallest = arr[0]
	for x in arr:
		if x < smallest:
			smallest = x
	return smallest


def find_smallest_int(arr):
	num = arr[0]
	for i in arr:
		if i < num:
			num = i
		else:
			num = num
	return num


def find_smallest_int(arr):
	smallest = 1000000
	for i in range(0, len(arr), 1):
		if arr[i] < smallest:
			smallest = arr[i]
			arr.append(smallest)
	return arr[-1]


def find_smallest_int(arr):
	anwser = 9999999
	for a in arr:
		if a < anwser:
			anwser = a
	return anwser


def find_smallest_int(arr):
	number = arr[0]
	for nb in arr:
		if nb < number:
			number = nb
	return number


import numpy as np

def find_smallest_int(arr=[]):
	return np.min(arr)


import math

def find_smallest_int(arr):
	x = math.inf
	for i in arr:
		if i < x:
			x = i
	return x


import numpy as np

def find_smallest_int(arr):
	test = np.sort(arr)
	answer = int(test[0])
	return answer


def find_smallest_int(arr):
	a = 0
	b = 0
	while b < len(arr):
		if arr[a] <= arr[b]:
			b += 1
		elif arr[a] > arr[b]:
			a += 1
	return arr[a]


def find_smallest_int(arr):
	arr.sort()
	smallest = arr.pop(0)
	return smallest


import math

def find_smallest_int(arr):
	min = arr[0]
	for i in range(0, len(arr)):
		if arr[i] < min:
			min = arr[i]
	return min


def find_smallest_int(arr):
	smallest = 10 ** 1000
	for item in arr:
		if item >= smallest:
			pass
		else:
			smallest = item
	return smallest


def find_smallest_int(arr):
	arr.sort()
	arr.reverse()
	return arr.pop()


def find_smallest_int(arr):
	for val in arr:
		return min(arr)


def find_smallest_int(arr):
	n = len(arr)
	minimum = arr[0]
	for i in range(1, n):
		if arr[i] < minimum:
			minimum = arr[i]
	return minimum


def find_smallest_int(arr):
	smallest = None
	for n in arr:
		if smallest == None:
			smallest = n
		else:
			smallest = min(smallest, n)
	return smallest


def find_smallest_int(arr):
	smallest = 999999999999999999999999999999999999999999999999999
	for item in arr:
		if int(item) < smallest:
			smallest = item
	return smallest


def find_smallest_int(arr):
	lowest = 10000000000000
	for integer in arr:
		if integer < lowest:
			lowest = integer
	return lowest


def find_smallest_int(arr):
	arr.sort()
	return int(arr[0])


def find_smallest_int(arr):
	minor = arr[0]
	for el in arr:
		if el < minor:
			minor = el
			print(minor)
	return minor


def find_smallest_int(arr):
	x = arr[0]
	for num in arr:
		if num < x:
			x = num
		else:
			pass
	return x


def find_smallest_int(arr):
	print(arr)
	arr.sort()
	print(arr)
	out = arr.pop(0)
	print(out)
	return out


def find_smallest_int(arr):
	smallest_num = arr[0]
	for num in range(len(arr)):
		if arr[num] < smallest_num:
			smallest_num = arr[num]
	return smallest_num


def find_smallest_int(arr):
	v = min(arr)
	return v


def find_smallest_int(arr):
	min(arr)
	return min(arr)
find_smallest_int([78, 56, 232, 12, 11, 43])


def find_smallest_int(arr):
	min = arr[0]
	for pos in arr:
		if pos < min:
			min = pos
	return min


def find_smallest_int(arr):
	small = 100000000000000000000
	for i in arr:
		while i < small:
			small = i
	return small


def find_smallest_int(arr):
	for small in arr:
		if small == arr[0]:
			low = small
		elif low > small:
			low = small
	return low


def find_smallest_int(arr):
	val = arr[0]
	for x in arr:
		if x < val:
			val = x
	return val


def find_smallest_int(arr):
	st = set(arr)
	res = arr[0]
	for i in st:
		if i <= res:
			res = i
	return res


def find_smallest_int(arr):
	res = arr[0]
	for x in arr:
		if x < res:
			res = x
	return res


def find_smallest_int(arr):
	return min([int(i) for i in arr])


def find_smallest_int(arr):
	res = 99999999
	for i in arr:
		if i < res:
			res = i
	return res


def find_smallest_int(a):
	M = 1000000000000
	for i in range(len(a)):
		if a[i] < M:
			M = a[i]
	return M


def find_smallest_int(arr):
	n = len(arr)
	smallest = arr[0]
	for i in range(n):
		if arr[i] < smallest:
			smallest = arr[i]
	return smallest


def find_smallest_int(arr):
	arr2 = arr.sort()
	return arr[0]


def find_smallest_int(arr):
	arr_sort = arr.sort()
	return arr[0]


def find_smallest_int(arr, min=None):
	if len(arr) == 0:
		return min
	elif min == None or arr[0] < min:
		min = arr[0]
	return find_smallest_int(arr[1:], min)


def find_smallest_int(arr):
	min_val = arr[0]
	for val in arr:
		if val < min_val:
			min_val = val
	return min_val


def find_smallest_int(arr):
	smallest = arr[0]
	for n in arr[1:]:
		if n < smallest:
			smallest = n
	return smallest


def find_smallest_int(arr):
	s = arr[0]
	for i in arr[1:]:
		if i < s:
			s = i
	return s


def find_smallest_int(arr):
	arr.sort()
	k = arr[0]
	return k


def find_smallest_int(arr):
	array = arr.sort()
	return arr[0]


def find_smallest_int(arr):
	minVal = float('inf')
	for i in arr:
		if i < minVal:
			minVal = i
	return minVal


def find_smallest_int(arr):
	arr.sort()
	print(arr[0])
	return arr[0]


def find_smallest_int(arr):
	lowest = arr[0]
	for value in arr:
		if lowest > value:
			lowest = value
	return lowest


def find_smallest_int(arr):
	smallest = arr[0]
	for element in range(len(arr)):
		if arr[element] < smallest:
			smallest = arr[element]
	return smallest


def find_smallest_int(arr):
	smallest = None
	for number in arr:
		if smallest is None:
			smallest = number
		elif number < smallest:
			smallest = number
		else:
			continue
	return smallest