We have detected that Javascript is not enabled in your browser. The dynamic nature of our site means that Javascript must be enabled to function properly. Please read our terms and conditions for more information.

Next up

Sorting and Selection

Description

Mind Map on Sorting and Selection, created by Angelica Cordero on 22/05/2022.

Mind Map by Angelica Cordero, updated more than 1 year ago

	Created by Angelica Cordero over 3 years ago

4

0

Resource summary

Sorting and Selection

Merge-Sort
1. Divide-and-Conquer
  1. Divide (divide the input data into 2 or more disjoint subsets), conquer (recursively solve the subproblems), combine (merge the sorted sequences)
    1. Input sequences processed
    2. Output sequences generated
2. Array-Based Implementation
  1. Implementation of recursive algorithm for Java array
3. Running time
  1. Each node represents the time spent in a particular recursive call
  2. O(n log n)
4. Alternative Implementations
  1. Sorting Linked Lists
  2. A Bottom-Up (Nonrecursive) Merge-Sort

Media attachments

Show full summary Hide full summary

Want to create your own Mind Maps for free with GoConqr? Learn more.

Similar