COM1009 Introduction to Algorithms and Data Structures (SPRING 2016~17) Flashcards
1
Q
Best case runtime insertionsort
A
n
2
Q
Worst case runtime insertionsort
A
n^2
3
Q
Best case runtime mergesort
A
nlogn
4
Q
Worst case runtime mergesort
A
nlogn
5
Q
Best case runtime quicksort
A
nlogn
6
Q
Worst case runtime quicksort
A
n^2
7
Q
Best case runtime selectionsort
A
n^2
8
Q
Worst case runtime selectionsort
A
n^2
