Old Big O Flashcards
1
Q
Binary search (worst & average case)
A
W O(logn) A O(logn)
2
Q
Selection Sort (worst & average case)
A
W O(n^2) A O(n^2)
3
Q
Insertion sort (worst & average case)
A
W O(n^2) A O(n^2)
4
Q
Merge sort (worst & average case)
A
W O(nlogn) A O(nlogn)
5
Q
Quick sort (worst & average case)
A
W O(n^2) A O(nlogn)
