Back to marketplace
2.3.3 average time complexities of different sorting algorithms
No description yet. This curated deck is ready for daily study.
Total cards: 4•Content version: v3•Public deck•Updated: 8/1/2026
Card preview (4)
#1
Front (Question)
Merge sort
Back (Answer)
O(nlog(n)) but requires more space for the merging process
#2
Front (Question)
Quick sort
Back (Answer)
O(nlog(n)) (the fastest of all of the sorts)
#3
Front (Question)
Insertion sort
Back (Answer)
O(n^2) but it becomes O(n) is almost already sorted
#4
Front (Question)
Bubble sort
Back (Answer)
O(n^2) (the slowest out of all the sorting methods)