Find Minimum Element in Array

function findMin(nums) {
  let min = nums[0];
  for (let num of nums) {
    if (num < min) min = num;
  }
  return min;
}
                  

Explanation: We scan the array and update the minimum value whenever a smaller element is found.

⏱ O(n) | 💾 O(1)

class Solution {
  public int findMin(int[] nums) {
    int min = nums[0];
    for (int num : nums) {
      if (num < min) min = num;
    }
    return min;
  }
}
                  

Explanation: The minimum element is found by comparing each value once.

⏱ O(n) | 💾 O(1)

def find_min(nums):
    return min(nums)
                  

Explanation: Python's built-in min function returns the smallest value in the list.

⏱ O(n) | 💾 O(1)