###########################################################################
#                                                                         #
# Author: Daniel Mock                                                     #
#                                                                         #
# Purpose: To document progress in learning algorithms & data structures  #
#                                                                         #
# References: This question was generated by leetcode.com. The solution   #
# to the question was generated by Daniel Mock.                           #
#                                                                         #
###########################################################################
"brute force method, O(N). Use binary search for O(logN) complexity."
class Solution:
    def findMin(self, nums: List[int]) -> int:
        return min(nums)
