Merge Sort (OCR A-Level Computer Science): Flashcards

Divide-and-conquer

Divide, Conquer, Merge

Split the array into two halves

Recursively sort each half

Combine two sorted halves into single sorted array

$O(n \log n)$

$O(n)$

Yes

Maintains relative order of equal elements

Array size is 1 or less

Requires additional memory for temporary arrays

Particularly effective/works well