12345678910111213141516171819202122232425262728

class Solution:
    # Function to find the minimum element using linear search
    def findMin(self, nums):

        # Initialize answer with a large number
        min_val = float('inf')

        # Traverse each element
        for i in range(len(nums)):

            # Update minimum value
            min_val = min(min_val, nums[i])

        # Return the result
        return min_val

# Input array
nums = [4, 5, 6, 7, 0, 1, 2]

# Create object of Solution
sol = Solution()

# Call function and store result
result = sol.findMin(nums)

# Output the result
print("Minimum element is", result)

12345678910111213141516171819202122232425262728293031

class Solution {
    // Function to find the minimum element using linear search
    findMin(nums) {

        // Initialize answer with a large number
        let minVal = Infinity;

        // Traverse each element
        for (let i = 0; i < nums.length; i++) {

            // Update minimum value
            minVal = Math.min(minVal, nums[i]);
        }

        // Return the result
        return minVal;
    }
}

// Input array
const nums = [4, 5, 6, 7, 0, 1, 2];

// Create object of Solution
const sol = new Solution();

// Call function and store result
const result = sol.findMin(nums);

// Output the result
console.log("Minimum element is", result);

Complexity Analysis

Time Complexity: O(N), we check every element once.
Space Complexity: O(1), constant additonal space is used.

Optimal Approach