Two Largest Elements (Without Sorting)
Finds top 2 largest 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_largest(arr):
max1 = max2 = float('-inf')
for x in arr:
if x > max1:
max2, max1 = max1, x
elif x > max2:
max2 = x
return max1, max2Embed this visualization
Drop a live, looping Two Largest Elements (Without Sorting) canvas into a blog post or course page.
<iframe src="/embed/two-largest-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 Largest Elements (Without Sorting)?
Two Largest Elements (Without Sorting) runs in O(n) time and O(1) auxiliary space.
Is the Two Largest 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 Largest Elements (Without Sorting) in interviews?
Two Largest Elements (Without Sorting) shows up in interviews at Meta, Google, Uber.
How does the 3D visualization of Two Largest 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.