Two Smallest Elements (Without Sorting)
Finds top 2 smallest values in unsorted array using two comparison registers.
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 two_smallest(arr):
min1 = min2 = float('inf')
for x in arr:
if x < min1:
min2, min1 = min1, x
elif x < min2:
min2 = x
return min1, min2Embed this visualization
Drop a live, looping Two Smallest Elements (Without Sorting) canvas into a blog post or course page.
<iframe src="/embed/two-smallest-unsorted" 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 Two Smallest Elements (Without Sorting)?
Two Smallest Elements (Without Sorting) runs in O(n) time and O(1) auxiliary space.
Is the Two Smallest Elements (Without Sorting) 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 Two Smallest Elements (Without Sorting) in interviews?
Two Smallest Elements (Without Sorting) shows up in interviews at Twitter, Meta, Snapchat.
How does the 3D visualization of Two Smallest Elements (Without Sorting) 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.