Mind map
Sorting and Selection
Map content
Sorting and Selection
Merge-Sort
- Divide-and-Conquer
- Divide (divide the input data into 2 or more disjoint subsets), conquer (recursively solve the subproblems), combine (merge the sorted sequences)
- Input sequences processed
- Output sequences generated
- Divide (divide the input data into 2 or more disjoint subsets), conquer (recursively solve the subproblems), combine (merge the sorted sequences)
- Array-Based Implementation
- Implementation of recursive algorithm for Java array
- Running time
- Each node represents the time spent in a particular recursive call
- O(n log n)
- Alternative Implementations
- Sorting Linked Lists
- A Bottom-Up (Nonrecursive) Merge-Sort
- Divide-and-Conquer
Images and files in the map
Information
- Description
- Mind Map on Sorting and Selection, created by Angelica Cordero on 22/05/2022.
- Created by
- Angelica Cordero
- Views
- 4
- Rating