Back to Practice Dashboard
Python BasicsEasy

Smallest element in an array

Learn how to solve the 'Smallest element in an array' problem. This detailed resource details brute force and optimized approaches.

Problem Statement

Easy

Write a function find_smallest(arr) that finds and returns the smallest element in the given array arr using recursion. The function takes a list of integers as input and returns a single integer — the minimum value in the list.

Constraints
  • 1 <= len(arr) <= 1000
  • -10^6 <= arr[i] <= 10^6

Examples

Example 1
Input
arr = [1, 4, 3, -5, 15]
Output
-5
Explanation

Among all elements, -5 is the smallest.

Example 2
Input
arr = [10, 20, 5, 8]
Output
5
Explanation

5 is the minimum value in the array.

Example 3
Input
arr = [-3, -7, -1, -9]
Output
-9
Explanation

Among all negative numbers, -9 is the smallest.

Need a Hint?
Use simple arithmetic operators (like modulo `%`, division `//`), conditional checks, or loops to inspect number properties.
Edge Cases to Watch
  • Empty list or null input variables
  • Single item lists/arrays
  • Extremely large input bounds causing integer or stack overflow

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor