merge-sort

Recursive halving technique

Merge-sort is a sorting algorithm that works by repeatedly dividing a list in half until each piece contains one element, then merging the pieces back together in sorted order.

It's efficient and predictable—always O(n log n)—making it a standard choice for sorting large datasets.

The professor explained why merge-sort outperforms bubble sort on big arrays.

merge

combine

Merge, or harvesting machine

converge · unify · coalesce · reassemble · stitch · recombine

divide

split

Separation into parts

bisect · decompose · segment · subarray · sublist · midpoint · breakdown

algorithm

recursion

Process invoking itself

subproblem · in-place · out-of-place · worst-case · best-case · asymptotic · logarithmic

sequence

array

Ordered collection or display

  • listSequence of recorded items
  • elementsFundamental parts or substances
  • integersNumbers without fractional components

strings · records · keys · values · items · indices · input · output · collection

order

ascending

Moving upward

lexicographic · numerical · rank · unsorted

Opposites
space complexity

merge-sortquicksort

Recursive partitioning sort method

Family

merge, sort, merged, merges, merging, merger, mergers, sorted, sorts

Familiarity
Top 1,000,000
Profile
Used worldwide · Timeless · Abstract · Rated G