# Merge Sort

Learn about merge sort, one of the key sorting algorithms used in real-life projects.

## We'll cover the following

## Merge sort

**Merge sort** is a recursive divide-and-conquer algorithm that essentially divides a given list into two halves, sorts those halves, and merges them in order. The base case is to merge two lists of size 1 so, eventually, single elements are merged in order; the merge part is where most of the heavy lifting happens.

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.