Mindmap
Merge Sort
Inhalt der Mindmap
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.
Informationen
- Beschreibung
- Mindmap am Merge Sort, erstellt von Harriet Leplar am 17/05/2021.
- Erstellt von
- Harriet Leplar
- Aufrufe
- 0
- Bewertung