Flashcards
Sorting & Searching Algorithms
Cards in this deck (2)
- 1QuickSort Time & Space Complexity- Time -
Average: O(n log n)
Worst: O(n^2)
- Space -
O(log n) - 2MergeSort Time & Space Complexity- Time -
Average & Worst
O(n log n)
- Space -
Depends (typically O(n))
Information
- Description
- Software Development (Algorithms) Flashcards on Sorting & Searching Algorithms, created by Jasen M on 25/07/2016.
- Created by
- Jasen M
- Views
- 10
- Tags
- Rating