| Question | Answer |
| QuickSort Time & Space Complexity | - Time - Average: O(n log n) Worst: O(n^2) - Space - O(log n) |
| MergeSort Time & Space Complexity | - Time - Average & Worst O(n log n) - Space - Depends (typically O(n)) |
Want to create your own Flashcards for free with GoConqr? Learn more.