Unit 8 Lesson 6 - Merge Sort

Lesson summary and assignments

Vocabulary

divide-and-conquer
the process of dividing a problem into smaller problems, solving the smaller problems independently, then combining the solutions to solve the original problem
helper function
a function that performs a component of another function
merge sort
a divide-and-conquer sorting algorithm that repeatedly breaks down a list into sublists until each sublist consists of a single element and merges those sorted sublists until it results into a sorted list