Interactive Python Lab

Insertion Sort

Playground load hone par auto-run hota hai. Apne Python ko trace karne ke liye Mera Code Chalao par click karein — har step live animated.

Samjhein·Line by line

Replay·Step by step

Challenge·Guided prompts

XP·...

Data Flow Pipeline

intermediate Track

Binary Search

Selection Sort

Stack Operations

Insertion Sort

Hash Map Counting

Two Pointers

Queue Operations

Anagram Check

Sliding Window Max Sum

Merge Sorted Arrays

Samjhein

Line 1

arr = [5, 2, 4, 1, 3]. We'll grow a sorted prefix from the left.

Yeh approach kyun?

Insertion sort treats the first element as a sorted list of size 1. Each subsequent element is inserted into its correct position in the already-sorted left portion.

Structured Explanation

Overview

Insertion sort aise kaam karta hai jaise cards sort karte ho haath mein — ek ek card sahi position pe daalo.

Analogy

Jaise hand of cards sort karna — ek card uthao, sahi jagah insert karo sorted pile mein.

Step-by-step

Index 1 se shuru karo
Current element ko uthao (key)
Pichhe ke sorted elements se compare karo
Bade elements ko aage shift karo aur key insert karo

Visual

[5, 3, 4, 1, 2] -> [3, 5, 4, 1, 2] -> [3, 4, 5, 1, 2] -> [1, 3, 4, 5, 2] -> [1, 2, 3, 4, 5]

Common mistakes

Inner loop condition: j >= 0 aur arr[j] > key dono check karo
Off-by-one: range(1, n)
Shift karna nahi bhoolna — simply swap mat karo

Practice questions

Insertion sort implement karo aur visualize karo
Nearly sorted array pe insertion sort karo — nearly O(n) hai

Complexity

Time

O(n²) worst, O(n) best

Space

O(1)

Complexity Overview

O(1)space

O(log n)

O(n)time

O(n log n)

O(n²)time

n = 8range 1-20

N = 8 pe

Complexity	Operations
O(1)	1
O(log n)	3
O(n)	8
O(n log n)	24
O(n²)	64

Challenge

Insertion Sort

Hint

Har element ko sorted part mein sahi jagah insert karo.

Code Studio

Insertion Sort

Monaco Ready

Python ready hai

lesson.pyline 1

Loading editor...

Output Console

0 lines

Abhi tak koi output nahi...

Real-World Applications

1

Nearly sorted data par bahut efficient (O(n))

2

Real-time data jo one-by-one aata hai use sort karna

3

Small arrays ke liye simple aur fast

Comments

Loading comments...