Find Smallest Number
Scans the array linearly, comparing each element to maintain the minimum value encountered.
Live loop — open the studio to scrub, add your own array, or race it in Battle Arena.
Asked in interviews at
Reference implementation (Python)
def find_smallest(arr):
min_val = arr[0]
for i in range(1, len(arr)):
if arr[i] < min_val:
min_val = arr[i]
return min_valEmbed this visualization
Drop a live, looping Find Smallest Number canvas into a blog post or course page.
<iframe src="/embed/find-smallest" width="100%" height="380" style="border:1px solid #e6e8ec;border-radius:14px" loading="lazy" title="3D algorithm visualization by CodeWithMunnaX"></iframe>Frequently asked
What is the time and space complexity of Find Smallest Number?
Find Smallest Number runs in O(n) time and O(1) auxiliary space.
Is the Find Smallest Number visualizer free?
The core 3D visualizer, Web Audio chimes and step intuition are free. A one-time ₹49 Pro Pass unlocks advanced algorithms, large custom arrays, Battle Arena and reel export.
Which companies ask Find Smallest Number in interviews?
Find Smallest Number shows up in interviews at Amazon, Swiggy, Flipkart.
How does the 3D visualization of Find Smallest Number work?
Each array value becomes a 3D pillar whose height maps to its value. Comparisons glow amber, swaps flash red, and settled elements lock green while a floating pointer badge tracks the active index — synchronized line-by-line with the Python code.