Your task is to make two functions, ```max``` and ```min``` (`maximum` and `minimum` in PHP and Python) that take a(n) array/vector of integers ```list``` as input and outputs, respectively, the largest and lowest number in that array/vector.

#Examples
```python
maximun([4,6,2,1,9,63,-134,566]) returns 566
minimun([-52, 56, 30, 29, -54, 0, -110]) returns -110
maximun([5]) returns 5
minimun([42, 54, 65, 87, 0]) returns 0
```

#Notes
- You may consider that there will not be any empty arrays/vectors.

Source: codewars | Difficulty: EASY
Tags: Fundamentals

Starter code: def minimum(arr):
	

Solutions:
minimum = min
maximum = max


def minimum(arr):
	return min(arr)

def maximum(arr):
	return max(arr)


def minimum(arr):
	min = None
	for i in arr:
		if min == None:
			min = i
		elif i < min:
			min = i
	return min

def maximum(arr):
	max = None
	for i in arr:
		if max == None:
			max = i
		elif i > max:
			max = i
	return max


def minimum(arr):
	min_ = arr[0]
	for e in arr[1:]:
		if e < min_:
			min_ = e
	return min_

def maximum(arr):
	max_ = arr[0]
	for e in arr[1:]:
		if e > max_:
			max_ = e
	return max_


def minimum(arr):
	min = arr[0]
	for num in arr:
		if num < min:
			min = num
	return min

def maximum(arr):
	max = 0
	for num in arr:
		if num > max:
			max = num
	return max


def minimum(arr):
	current_best = arr[0]
	for i in arr:
		if i < current_best:
			current_best = i
	return current_best

def maximum(arr):
	current_best = arr[0]
	for i in arr:
		if i > current_best:
			current_best = i
	return current_best


def minimum(arr):
	minarr = min(arr)
	return minarr

def maximum(arr):
	maxarr = max(arr)
	return maxarr


def minimum(arr):
	Min = arr[0]
	for e in arr:
		if e < Min:
			Min = e
	return Min

def maximum(arr):
	Max = arr[0]
	for e in arr:
		if e > Max:
			Max = e
	return Max


def minimum(arr):
	num = None
	for i in arr:
		if not num:
			num = i
		elif i < num:
			num = i
	return num

def maximum(arr):
	num = 0
	for i in arr:
		if i > num:
			num = i
	return num


def minimum(arr):
	s = min(arr)
	return s

def maximum(arr):
	x = max(arr)
	return x


def minimum(arr):
	min_value = arr[0]
	for num in arr:
		if num < min_value:
			min_value = num
	return min_value

def maximum(arr):
	max_value = arr[0]
	for num in arr:
		if num > max_value:
			max_value = num
	return max_value


def minimum(arr):
	m = arr[0]
	for i in arr:
		if m > i:
			m = i
	return m

def maximum(arr):
	t = arr[0]
	for i in arr:
		if i > t:
			t = i
	return t


def minimum(arr):
	min = arr[0]
	while len(arr) > 1:
		if arr[1] < min:
			min = arr[1]
			arr.pop(0)
		else:
			arr.pop(1)
	return min

def maximum(arr):
	max = arr[0]
	while len(arr) > 1:
		if arr[1] > max:
			max = arr[1]
			arr.pop(0)
		else:
			arr.pop(1)
	return max


def minimum(arr):
	lowest_num = 999999999999999
	for x in arr:
		if x < lowest_num:
			lowest_num = x
	return lowest_num

def maximum(arr):
	highest_num = 0
	for x in arr:
		if x > highest_num:
			highest_num = x
	return highest_num


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

def maximum(arr):
	for i in range(len(arr) - 1):
		if arr[i] > arr[i + 1]:
			(arr[i], arr[i + 1]) = (arr[i + 1], arr[i])
	return arr[len(arr) - 1]


def minimum(arr):
	y = 0
	for x in arr:
		if y == 0:
			y = x
		elif x < y:
			y = x
	return y

def maximum(arr):
	y = 0
	for x in arr:
		if y == 0:
			y = x
		elif x > y:
			y = x
	return y


def minimum(arr):
	a = 100000000000000000000000000000000000
	for i in range(len(arr)):
		if arr[i] < a:
			a = arr[i]
	return a

def maximum(arr):
	a = -1000000000000000000000000000000000000000000
	for i in range(len(arr)):
		if arr[i] > a:
			a = arr[i]
	return a


def minimum(arr):
	Min = arr[0]
	for i in arr:
		if i < Min:
			Min = i
	return Min

def maximum(arr):
	Max = arr[0]
	for i in arr:
		if i > Max:
			Max = i
	return Max


def minimum(arr):
	for num in arr:
		return min(arr)

def maximum(arr):
	for num in arr:
		return max(arr)


def minimum(arr):
	smallest = None
	for i in arr:
		if smallest is None:
			smallest = i
		elif i < smallest:
			smallest = i
	return smallest

def maximum(arr):
	largest = 0
	for i in arr:
		if i > largest:
			largest = i
		else:
			largest = largest
	return largest


def minimum(arr):
	min = arr[0]
	for i in arr:
		if i <= min:
			min = i
	return min

def maximum(arr):
	max = arr[0]
	for i in arr:
		if i >= max:
			max = i
	return max


def minimum(arr: []):
	result = arr[0]
	for i in arr:
		if i < result:
			result = i
	return result

def maximum(arr: []):
	result = arr[0]
	for i in arr:
		if i > result:
			result = i
	return result


import statistics

def minimum(a):
	return min(a)

def maximum(a):
	return max(a)


def minimum(arr):
	min_value = min(arr)
	return min_value

def maximum(arr):
	max_value = max(arr)
	return max_value


def minimum(arr):
	if not arr:
		return 0
	return min(arr)

def maximum(arr):
	if not arr:
		return 0
	return max(arr)


def minimum(arr):
	numbers = arr
	numbers.sort()
	minimum_number = numbers[0]
	return minimum_number

def maximum(arr):
	numbers = arr
	numbers.sort()
	max_number = numbers[-1]
	return max_number


def minimum(arr):
	min = 9999999999999999999
	for i in arr:
		if min > i:
			min = i
	return min

def maximum(arr):
	max = -9999999999999999999
	for i in arr:
		if max < i:
			max = i
	return max


def minimum(arr):
	new = []
	for num in arr:
		if new == []:
			new = num
		if num < new:
			new = num
		else:
			pass
	return new

def maximum(arr):
	new = []
	for num in arr:
		if new == [] or int(num) > new:
			new = num
		else:
			pass
	return new


def minimum(arr):
	arr = sorted(list(arr))
	return arr[0]

def maximum(arr):
	arr = sorted(list(arr))
	return arr[-1]


def minimum(arr):
	x = list(map(int, arr))
	return min(sorted(x))

def maximum(arr):
	return max(arr)


def minimum(arr):
	a = sorted(arr)
	return a[0]

def maximum(arr):
	a = sorted(arr)
	return a[-1]


def minimum(arr):
	sorted_arr = sorted(arr)
	return sorted_arr[0]

def maximum(arr):
	sorted_arr = sorted(arr)
	return sorted_arr[-1]


def minimum(arr):
	mi = 100000
	for a in arr:
		if a < mi:
			mi = a
	return mi

def maximum(arr):
	ma = -1000000
	for b in arr:
		if b > ma:
			ma = b
	return ma


def minimum(arr):
	min = float('inf')
	for x in arr:
		if x < min:
			min = x
	return min

def maximum(arr):
	max = float('-inf')
	for x in arr:
		if x > max:
			max = x
	return max


def minimum(arr):
	low = arr[0]
	for i in arr:
		if i < low:
			low = i
	return low

def maximum(arr):
	high = arr[0]
	for i in arr:
		if i > high:
			high = i
	return high


def minimum(arr):
	small = min(arr)
	return small

def maximum(arr):
	large = max(arr)
	return large


def minimum(arr):
	mini = arr[0]
	for num in arr:
		if num < mini:
			mini = num
	return mini

def maximum(arr):
	maxi = arr[0]
	for num in arr:
		if num > maxi:
			maxi = num
	return maxi


def minimum(arr):
	min1 = min(arr)
	return min1

def maximum(arr):
	max1 = max(arr)
	return max1


def minimum(arr):
	currentSmallest = arr[0]
	for x in range(1, len(arr)):
		if arr[x] < currentSmallest:
			currentSmallest = arr[x]
	return currentSmallest

def maximum(arr):
	currentLargest = arr[0]
	for x in range(1, len(arr)):
		if arr[x] > currentLargest:
			currentLargest = arr[x]
	return currentLargest


def minimum(arr):
	minv = 100000000.0
	for i in range(len(arr)):
		if arr[i] < minv:
			minv = arr[i]
	return minv

def maximum(arr):
	maxv = -100000000.0
	for i in range(len(arr)):
		if arr[i] > maxv:
			maxv = arr[i]
	return maxv


def minimum(arr):
	min = 1000000000
	for i in arr:
		if i < min:
			min = i
	return min

def maximum(arr):
	max = -1000000000
	for i in arr:
		if i > max:
			max = i
	return max


def minimum(arr):
	swapped = True
	while swapped:
		swapped = False
		for i in range(len(arr) - 1):
			if arr[i] > arr[i + 1]:
				(arr[i], arr[i + 1]) = (arr[i + 1], arr[i])
				swapped = True
	return arr[0]

def maximum(arr):
	swapped = True
	while swapped:
		swapped = False
		for i in range(len(arr) - 1):
			if arr[i] > arr[i + 1]:
				(arr[i], arr[i + 1]) = (arr[i + 1], arr[i])
				swapped = True
	return max(arr)


def minimum(arr):
	answer = arr[0]
	for i in arr:
		if i < answer:
			answer = i
	return answer

def maximum(arr):
	answer = arr[0]
	for i in arr:
		if i > answer:
			answer = i
	return answer


def minimum(arr):
	val = arr[0]
	for i in arr:
		if i < val:
			val = i
	return val

def maximum(arr):
	val = arr[0]
	for i in arr:
		if i > val:
			val = i
	return val


from functools import reduce

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

def maximum(arr):
	return reduce(lambda x, y: x if x > y else y, arr)


def maximum(numbers):
	max_val = numbers[0]
	for i in range(len(numbers)):
		if numbers[i] > max_val:
			max_val = numbers[i]
	return max_val

def minimum(numbers):
	min_val = numbers[0]
	for i in range(len(numbers)):
		if numbers[i] < min_val:
			min_val = numbers[i]
	return min_val


def minimum(arr):
	min = sorted(arr)
	return min[0]

def maximum(arr):
	max = sorted(arr)
	return max[len(max) - 1]


def minimum(arr):
	base = arr[0]
	if len(arr) == 1:
		return base
	else:
		for number in arr:
			if number < base:
				base = number
		return base

def maximum(arr):
	base = arr[0]
	if len(arr) == 1:
		return base
	else:
		for number in arr:
			if number > base:
				base = number
		return base


def minimum(arr):
	arr.sort()
	return arr[0]

def maximum(arr):
	arr.sort()
	arr.reverse()
	return arr[0]


def minimum(arr):
	smol = 1000
	for i in range(0, len(arr)):
		if arr[i] < smol:
			smol = arr[i]
	return smol

def maximum(arr):
	beeg = 0
	for i in range(0, len(arr)):
		if arr[i] > beeg:
			beeg = arr[i]
	return beeg