Python BasicsEasy

Smallest element in an array

Detailed guide and Python implementation for the 'Smallest element in an array' problem.

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?
Consider using Recursion-specific data structures like sets or heaps.
Edge Cases to Watch
  • Empty input structures
  • Single element inputs
  • Large numerical bounds

Ready to Solve?

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

Open in Editor

Recommended Python Resources

Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.