DSA · Theory

Merge Sort Algorithm

Theory

52/810

Merge Sort Algorithm

Merge Sort Algorithm is a DSA topic. In plain words you use it for names A→Z in the roll list. Don’t start with a slogan — start with that picture.

Smallest example: n log n vs n². Type it, run it, and say what you see. If you can do that from memory, you know Merge Sort Algorithm.

From the example next to this theory: Merge Sort Algorithm — merge sort divides the array, sorts halves, then merges — O(n log n).

Trap — unstable sort when equal keys matter. Fix that before you talk about advanced DSA.

Viva — what is Merge Sort Algorithm? Then show n log n vs n². Then name the trap.

Exam tip

What is Merge Sort Algorithm? Show this: n log n vs n². Trap: unstable sort when equal keys matter.

Example

def merge_sort(arr):
    if len(arr) <= 1:
        return arr
    mid = len(arr) // 2
    left = merge_sort(arr[:mid])
    right = merge_sort(arr[mid:])
    out, i, j = [], 0, 0
    while i < len(left) and j < len(right):
        if left[i] <= right[j]:
            out.append(left[i]); i += 1
        else:
            out.append(right[j]); j += 1
    return out + left[i:] + right[j:]

print(merge_sort([5, 1, 4, 2]))

Merge Sort Algorithm — merge sort divides the array, sorts halves, then merges — O(n log n).

Short notes

DefMerge Sort Algorithm — names A→Z in the roll list.
Rulen log n vs n²
Trapunstable sort when equal keys matter
Usethe roll list

def merge_sort(arr): if len(arr) <= 1: return arr mid = len(arr) // 2 left = merge_sort(arr[:mid]) right = merge_sort(arr[mid:]) out, i, j = [], 0, 0 while i < len(left) and j < len(right): if left[i] <= right[j]: out.append(left[i]); i += 1 else: out.append(right[j]); j += 1 return out + left[i:] + right[j:] print(merge_sort([5, 1, 4, 2]))

Merge Sort Algorithm

Example

Short notes

Questions

Merge Sort Algorithm

Example

Short notes

Questions