Mind map
Merge Sort
Map content
Merge Sort
Splits a list down into individual components and then joins them up, ordering them as you go.
Agnostic about the order of the list before the sort, as the list is divided up anyway.
Time complexity
- O(n log n) meaning a linear algorithm. Time increases in proportion to n.
Information
- Description
- Mind Map on Merge Sort, created by Harriet Leplar on 17/05/2021.
- Created by
- Harriet Leplar
- Views
- 0
- Rating