Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
41 Cards in this Set
- Front
- Back
|
quicksort best case
|
nlogn
|
|
|
quicksort average case
|
nlogn
|
|
|
quicksort worst case
|
n^2
|
|
|
quicksort memory
|
logn
|
|
|
quicksort is stable?
|
Depends...
|
|
|
quicksort method used?
|
partitioning
|
|
|
bubblesort bestcase
|
n
|
|
|
bubblesort average
|
n^2
|
|
|
bubblesort worstcase
|
n^2
|
|
|
bubblesort memory
|
1
|
|
|
bubblesort is stable?
|
yes
|
|
|
bubble sort method used?
|
exchange
|
|
|
insertion sort best case
|
n
|
|
|
insertion sort average case
|
n^2
|
|
|
insertion sort worst case
|
n^2
|
|
|
insertion sort space complexity
|
1
|
|
|
insertion sort method used
|
insertion
|
|
|
heap sort best case
|
nlogn
|
|
|
heap sort average case
|
nlogn
|
|
|
heap sort worst case
|
nlogn
|
|
|
heap sort space complexity
|
1
|
|
|
heap sort is stable?
|
no
|
|
|
heap sort method used
|
Merging
|
|
|
merge sort best case
|
nlogn
|
|
|
merge sort average case
|
nlogn
|
|
|
merge sort worst case
|
nlogn
|
|
|
merge sort space complexity
|
depends; worst case is n
|
|
|
merge sort is stable?
|
yes
|
|
|
merge sort method used?
|
merging
|
|
|
shell sort best case
|
n
|
|
|
shell sort average case
|
n(logn)^2
|
|
|
shell sort worst case
|
n(logn)^2
|
|
|
shell sort space complexity
|
1
|
|
|
shell sort is stable?
|
no
|
|
|
shell sort method used?
|
insertion. Great for embedded systems where memory is at premium.
|
|
|
selection sort best case
|
n^2
|
|
|
selection sort average case
|
n^2
|
|
|
selection sort worst case
|
n^2
|
|
|
selection sort memory complexity
|
1
|
|
|
selection sort is stable?
|
no
|
|
|
selection sort method used
|
selection; it is stable when using o(n) extra space, using lists for example. useful when swapping is expensive.
|
