DSA Notes
HubAlgorithm vs Data Structure — Key Differences, Definitions, and How They Work TogetherApplications of DSA — How Data Structures and Algorithms Power Real-World SoftwareTime and Space Complexity — A Complete BeginnerWhat is DSA? — A Complete BeginnerWhy Learn DSA? — Career Benefits, Real-World Impact, and Long-Term ValueAsymptotic Analysis — Complete Framework with Recurrence Relations and Master TheoremBest, Average, and Worst Case Analysis — A Practical Guide for Every AlgorithmBig O Notation — Complete Guide with Formal Definition, Rules, and ExamplesBig Omega Notation — Lower Bounds, Best Case, and Formal DefinitionBig Theta (Θ) Notation — Tight Bounds and Exact Growth RatesSpace Complexity — Memory Analysis, Auxiliary Space, and Time-Space TradeoffsTime Complexity Examples — 25 Worked Problems from Basic to AdvancedArray Interview Problems — 15 Classic Problems with Complete SolutionsArray Operations — Every Operation Explained with Code, Complexity, and Edge CasesArray Rotation — Algorithms, Techniques, and Interview ProblemsArray Searching — Linear Search, Binary Search, and Advanced TechniquesArrays — The Complete Introduction to the Most Fundamental Data StructureDynamic Arrays — How Python Lists and ArrayLists Work InternallyMultidimensional Arrays — 2D Arrays, Matrices, and Memory LayoutSliding Window Technique — Complete Guide with 10 Classic ProblemsAnagram Problems — Detection, Grouping, and Sliding Window VariationsPalindrome Problems — Check, Longest, Count, and Expand Around CenterPattern Searching — KMP, Rabin-Karp, and Boyer-Moore AlgorithmsString Interview Problems — 10 Classic Problems with Complete SolutionsString Matching — Longest Common Subsequence, Edit Distance, and Z-AlgorithmString Operations — Complete Reference with Complexity and ImplementationStrings — Complete Introduction to String Data Structure and OperationsCircular Linked List — Structure, Operations, and ApplicationsDoubly Linked List — Complete Implementation with Bidirectional OperationsLinked List Interview Problems — 12 Classic Problems with Complete SolutionsLinked Lists — A Complete Introduction with Memory Model and TypesLinked List Operations — Every Technique with Code and ComplexityReverse Linked List — All Approaches from Basic to AdvancedSingly Linked List — Complete Implementation with All OperationsBalanced Parentheses — Stack-Based Validation with All VariantsInfix, Prefix, and Postfix Expressions — Stack-Based Conversion and EvaluationStack Implementation — Three Complete Implementations with Edge CasesStack Interview Problems — 10 Classic Problems with Complete SolutionsStack — Complete Introduction to LIFO Data StructureStack Using Arrays — Memory Layout, Capacity Management, and PerformanceStack Using Linked List — Implementation, Analysis, and When to Use ItCircular Queue — The Ring Buffer Explained with ImplementationDeque — Double-Ended Queue with Complete Implementation and ApplicationsPriority Queue — Complete Guide from Concept to ImplementationQueue Applications — BFS, Level-Order Traversal, 01-BFS, and MoreQueue Implementation — Array, Linked List, and Two-Stack ApproachesQueue Interview Problems — 10 Classic Problems with Complete SolutionsQueue — Complete Introduction to the FIFO Data StructureAVL Tree - Self-Balancing Binary Search TreeBinary Search Tree (BST)Binary Tree - Structure and OperationsFenwick Tree (Binary Indexed Tree)Red-Black Tree - Another Balanced BSTSegment Tree - Range Query Data StructureTree Interview Problems CollectionTree Data Structure FundamentalsTree Traversals - Inorder, Preorder, Postorder, Level OrderHeap — Complete Introduction to the Priority-Based Tree Data StructureHeap Operations — Complete Reference with Complexity AnalysisHeap Problems — 8 Classic Interview Problems with Complete SolutionsMax Heap — Complete Implementation and ApplicationsMin Heap — Complete Implementation with All OperationsPriority Queue Using Heap — Implementation, Applications, and PatternsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionBFS Algorithm — Breadth-First Search with All Applications and VariantsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsDijkstraFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisGraph Interview Problems — 12 Classic Problems with Complete SolutionsGraph — Complete Introduction to the Most Powerful Data StructureGraph Representation — Adjacency List, Matrix, Edge List with Complete AnalysisKruskalMinimum Spanning Tree — Definition, Properties, and ApplicationsPrimShortest Path Algorithms — Complete Comparison and Selection GuideTopological Sorting — DFS and BFS (KahnUnion-Find (DSU) in Graphs — Connected Components and Dynamic ConnectivitySeparate Chaining — Complete Implementation and AnalysisCollision Handling — Chaining vs Open Addressing Complete ComparisonHash Functions — Design, Properties, and Common ImplementationsHashing — Complete Introduction to Hash Tables and Hash FunctionsHashing Problems — 10 Classic Interview Problems with Complete SolutionsOpen Addressing — Linear Probing, Quadratic Probing, and Double HashingBubble Sort — Complete Analysis with Optimizations and When to Use ItCounting Sort — O(n+k) Sorting That Breaks the Comparison Lower BoundHeap Sort — Guaranteed O(n log n) with O(1) SpaceInsertion Sort — The O(n) Best Case Sort That Powers PythonMerge Sort — Complete Guide to the Guaranteed O(n log n) Stable SortQuick Sort — The Fastest Practical Sorting Algorithm with Complete AnalysisRadix Sort — O(nk) Digit-by-Digit Sorting for Large Integer RangesSelection Sort — Complete Analysis with Swaps Minimization PropertySorting Algorithm Comparison — The Complete Decision GuideSorting — Complete Introduction to Sorting AlgorithmsBinary Search — Complete Guide with All Variants and Proof of CorrectnessInterpolation Search — O(log log n) Search for Uniformly Distributed DataLinear Search — Complete Guide with All Variants and ApplicationsSearch Algorithm Comparison — Choosing the Right Search for Every SituationSearching Interview Problems — 10 Classic Problems with Complete SolutionsTernary Search — Finding Maximum/Minimum of Unimodal FunctionsBacktracking Introduction — The Recursive Exploration with UndoRecursion Basics — The Complete BeginnerRecursion Problems — 12 Classic Problems from Basic to AdvancedRecursion Tree — Visualizing Recursion for Complexity AnalysisRecursion vs Iteration — When to Use Each and How to ConvertTail Recursion — Definition, Optimization, and Converting to IterationDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideDynamic Programming — Complete Introduction with Properties and Problem IdentificationFibonacci DP — From Exponential to Linear with Memoization and Matrix ExponentiationKnapsack Problem — 0/1, Unbounded, and Fractional with Complete AnalysisLongest Common Subsequence — Complete Guide with DP Table and String VariantsLongest Increasing Subsequence — O(n log n) with Patience SortingMatrix Chain Multiplication — Interval DP with Complete AnalysisMemoization — Top-Down Dynamic Programming with CachingTabulation — Bottom-Up Dynamic Programming with Complete Table BuildingActivity Selection Problem — Greedy Scheduling with Proof of CorrectnessFractional Knapsack — Greedy by Value Density with ProofGreedy Interview Problems — 10 Classic Problems with Complete SolutionsGreedy Algorithms — Complete Introduction with Proof TechniquesHuffman Coding — Optimal Prefix-Free Data CompressionJob Sequencing Problem — Greedy Scheduling with DeadlinesBacktracking — The Complete Guide to Recursive Exploration with UndoBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsN-Queens Problem — Complete Solution with Backtracking and OptimizationRat in a Maze — Backtracking Path Finding with All SolutionsSubset Generation — All Subsets, Combinations, and Partitions with BacktrackingSudoku Solver — Backtracking with Constraint PropagationCodeforces Guide — Complete Strategy to Reach 1800+ RatingCommon CP Techniques — Essential Algorithms Every Competitive Programmer Must KnowContest Strategies — How to Perform Your Best in Competitive Programming ContestsCompetitive Programming — Complete Introduction for BeginnersFast Input/Output — Why I/O Speed Matters and Complete Templates for C++ and PythonLeetCode Guide — Complete Strategy to Crack FAANG InterviewsBit Manipulation — Complete Guide with All Tricks and Interview ProblemsBloom Filter — Space-Efficient Probabilistic Membership TestingComputational Geometry — Points, Lines, Convex Hull, and Geometric AlgorithmsDisjoint Set Union (DSU) — Union-Find with Path Compression and Union by RankRandomized Algorithms — Las Vegas, Monte Carlo, and Probabilistic TechniquesSkip List — The Probabilistic Data Structure that Competes with Balanced BSTsSuffix Array — Construction, LCP Array, and String Search ApplicationsTrie Data Structure — Complete Guide with Implementation and ApplicationsAutocomplete System Using TrieLibrary Management System Using DSARoute Finder Using GraphsMini Search Engine ProjectSocial Network Analysis Using GraphsEssential Coding Patterns for InterviewsDSA Cheatsheet: Quick ReferenceEssential DSA Interview QuestionsFAANG DSA Sheet: Company-Specific Patterns and ProblemsProblem Solving Strategies for Coding InterviewsComplexity CheatsheetImportant Algorithms SummaryBest Practice Platforms for DSARecommended Books for DSA
Master merge sort completely — the divide-and-conquer approach, step-by-step trace, formal correctness proof, recurrence relation solution, bottom-up vs top-down implementation, natural merge sort for nearly sorted data, counting inversions, and all comparison-based optimizations.
The Core Idea
Merge sort is based on a simple observation: merging two sorted arrays is easy and fast.
If you have two sorted arrays, you can merge them into one sorted array in O(n) time by always taking the smaller of the two front elements.
The divide-and-conquer strategy:
- Divide: Split the array in half
- Conquer: Recursively sort each half
- Combine: Merge the two sorted halves
Example
[38, 27, 43, 3, 9, 82, 10]
Divide:
[38, 27, 43, 3] [9, 82, 10]
Divide:
[38, 27] [43, 3] [9, 82] [10]
Divide:
[38][27] [43][3] [9][82] [10]
Merge (pairs):
[27, 38] [3, 43] [9, 82] [10]
Merge (groups):
[3, 27, 38, 43] [9, 10, 82]
Merge (final):
[3, 9, 10, 27, 38, 43, 82]
Implementation — Bottom-Up (Iterative)
Example
def merge_sort_bottom_up(arr):
"""
Bottom-up merge sort: merge pairs, then groups of 4, 8, ...
Same O(n log n) time, O(n) space.
No recursion → no call stack overhead.
"""
n = len(arr)
width = 1 # Start by merging pairs
while width < n:
for i in range(0, n, 2 * width):
left = arr[i : i + width]
right = arr[i + width : i + 2 * width]
merged = merge(left, right)
arr[i : i + len(merged)] = merged
width *= 2 # Double the merge width
return arr
print(merge_sort_bottom_up([38, 27, 43, 3, 9, 82, 10]))
# [3, 9, 10, 27, 38, 43, 82]
In-Place Merge (for sorted array portions)
Example
def merge_inplace(arr, left, mid, right):
"""
Merge arr[left..mid] and arr[mid+1..right] in-place.
Used when working on a sub-array of the original.
"""
n1 = mid - left + 1
n2 = right - mid
# Create temporary arrays
L = arr[left:mid + 1]
R = arr[mid + 1:right + 1]
i = j = 0
k = left
while i < n1 and j < n2:
if L[i] <= R[j]:
arr[k] = L[i]; i += 1
else:
arr[k] = R[j]; j += 1
k += 1
while i < n1:
arr[k] = L[i]; i += 1; k += 1
while j < n2:
arr[k] = R[j]; j += 1; k += 1
Complexity Analysis
Time Complexity — Always O(n log n)
Recurrence: T(n) = 2T(n/2) + O(n)
Recursion Tree:
| Level 0: 1 problem of size n | n work |
| Level 1: 2 problems of n/2 | n work |
| Level 2: 4 problems of n/4 | n work |
| Level log n: n problems of 1 | n work |
| Total levels | log n |
| Work per level | n |
| Total | n × log n = O(n log n) |
This is always O(n log n) — best case, average case, worst case. There is no lucky input that causes less work.
Space Complexity — O(n)
Each merge step creates a temporary array. At any point, at most O(n) extra space is in use (the current merge level's temporary storage).
The recursion stack adds O(log n) space. Total: O(n) dominated by the merge arrays.
Why Merge Sort is Stable
The merge step uses left[i] <= right[j] — taking from the left array first when equal. This preserves the original order of equal elements.
| (3,'A') vs (3,'B'): 3<=3 | take (3,'A') from left first |
| (3,'C') vs (3,'B'): 3<=3 | take (3,'C') from left first |
| Result | [(3,'A'), (3,'C'), (3,'B'), (3,'D')] |
Application — Counting Inversions
An inversion is a pair (i, j) where i < j but arr[i] > arr[j]. The number of inversions measures how "unsorted" an array is.
Merge sort can count inversions in O(n log n) — a beautiful augmentation:
Example
def count_inversions(arr):
"""
Count inversions in arr using modified merge sort.
Time: O(n log n), Space: O(n)
"""
if len(arr) <= 1:
return arr, 0
mid = len(arr) // 2
left, left_inv = count_inversions(arr[:mid])
right, right_inv = count_inversions(arr[mid:])
merged, split_inv = merge_count(left, right)
return merged, left_inv + right_inv + split_inv
def merge_count(left, right):
result = []
inversions = 0
i = j = 0
while i < len(left) and j < len(right):
if left[i] <= right[j]:
result.append(left[i]); i += 1
else:
# left[i] > right[j]: ALL remaining left elements form inversions with right[j]
inversions += len(left) - i
result.append(right[j]); j += 1
result.extend(left[i:]); result.extend(right[j:])
return result, inversions
arr = [3, 1, 2, 4]
_, inv = count_inversions(arr)
print(inv) # 2 — (3,1) and (3,2)
Natural Merge Sort — O(n) on Sorted Data
Standard merge sort ignores existing order. Natural merge sort exploits natural runs in the data:
Example
def natural_merge_sort(arr):
"""
Find natural runs, then merge them.
O(n) on already-sorted data (one run = entire array → no merges needed).
O(n log n) worst case.
This is the core idea behind TimSort.
"""
def find_runs(arr):
"""Identify sorted subsequences."""
runs = []
i = 0
while i < len(arr):
j = i + 1
while j < len(arr) and arr[j] >= arr[j-1]:
j += 1
runs.append(arr[i:j])
i = j
return runs
runs = find_runs(arr)
while len(runs) > 1:
merged_runs = []
for i in range(0, len(runs), 2):
if i + 1 < len(runs):
merged_runs.append(merge(runs[i], runs[i+1]))
else:
merged_runs.append(runs[i])
runs = merged_runs
return runs[0] if runs else []
Summary
Merge sort is the guaranteed O(n log n) algorithm:
| Property | Value |
|---|---|
| Best case | O(n log n) — always this |
| Average case | O(n log n) |
| Worst case | O(n log n) |
| Space | O(n) auxiliary |
| Stable | ✅ Yes |
| Adaptive | ❌ No (unless using Natural Merge Sort) |
Choose Merge Sort when:
- Stable sort is required
- Guaranteed O(n log n) worst case needed
- Sorting linked lists (no random access needed)
- External sorting (data larger than RAM — merge works chunk by chunk)
- Counting inversions
Consider Quick Sort over Merge Sort when:
- Memory is limited (Quick Sort: O(log n) space vs O(n))
- Cache performance matters (Quick Sort is more cache-friendly)
*Next Lesson: Quick Sort*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Merge Sort — Complete Guide to the Guaranteed O(n log n) Stable Sort.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Data Structures & Algorithms topic.
Search Terms
data-structures-algorithms, data structures & algorithms, data, structures, algorithms, sorting, merge, sort
Related Data Structures & Algorithms Topics
Continue learning this concept
SortingBubble Sort — Complete Analysis with Optimizations and When to Use ItMaster bubble sort completely — the mechanism, step-by-step trace, optimized version with early termination, formal proof of correctness, time and space complexity analysis with all three cases, comparison with other O(n²) sorts, and when bubble sort is actually useful.SortingCounting Sort — O(n+k) Sorting That Breaks the Comparison Lower BoundMaster counting sort — how it breaks the O(n log n) comparison lower bound, the complete O(n+k) algorithm with stability proof, when k must be small for counting sort to be practical, the cumulative count technique for stable output, and applications in radix sort and frequency counting.SortingHeap Sort — Guaranteed O(n log n) with O(1) SpaceMaster heap sort completely — how heapify works, building a max-heap in O(n), the two-phase sorting process, why heap sort is O(n log n) in all cases with O(1) space, the weak cache performance trade-off, and comparison with merge sort and quick sort.SortingInsertion Sort — The O(n) Best Case Sort That Powers PythonMaster insertion sort completely — the card-dealing analogy, step-by-step trace, O(n) best case proof, binary insertion sort optimization, why it is used in PythonSortingQuick Sort — The Fastest Practical Sorting Algorithm with Complete AnalysisMaster quick sort completely — partition schemes (Lomuto and Hoare), randomized quick sort, 3-way partition for duplicates, average-case proof, worst-case prevention, why quick sort beats merge sort in practice despite equal asymptotic complexity, and tail-call optimization.SortingRadix Sort — O(nk) Digit-by-Digit Sorting for Large Integer RangesMaster radix sort — LSD and MSD variants, how it uses counting sort as a subroutine to sort digit by digit, why it achieves O(nk) time, sorting strings and multi-field records, comparison with counting sort and comparison sorts, and practical applications.