Given an array nums, return its smallest element. This is the mirror image of finding the largest element. The scanning version keeps a running minimumRunning MinimumThe smallest value seen so far while walking through a sequence. and updates it whenever something smaller appears; the sorting version is shorter but does far more work than necessary. Starting the running minimum at the first element (not at 0) keeps the answer correct for all-positive arrays.