lecture03

Lecture03

Insertion Sort & Merger Sort

Insertion Sort

• Time Complexity: 𝛩(n^2)
• Space Complexity: 𝛩(1)

1. Insertion sort
   • 𝛩(n^2) Compares, 𝛩(n^2) Swaps
2. Binary Insertion Sort
   • 𝛩(nlogn) Compares, 𝛩(n^2) Swaps

Merge Sort (divide and conquer)

• Time Complexity: 𝛩(nlogn)
• Space Complexity: 𝛩(n)