Unit 3 Test Flashcards
bubble sort best case
n*
bubble sort average case
n^2
bubble sort worst case
n^2
selection sort best case
n^2
selection sort average case
n^2
selection sort worst case
n^2
insertion sort best case
n
insertion sort average case
n^2
insertion sort worst case
n^2
shell sort with shells increments best case
n^2
shell sort with shells increments average case
n^2
shell sort with shells increments worst case
n^2
shell sort with hibbards increments best case
n^5/4
shell sort with hibbards increments average case
n^5/4
shell sort with hibbards increments worst case
n^3/2
heap sort best case
n log n
heap sort average case
n log n
heap sort worst case
n log n
mergesort best case
n log n
mergesort average case
n log n
mergesort worst case
n log n
quicksort best case
n log n
quicksort average case
n log n
quicksort worst case
n^2
radix sort best case
Kn
radix sort average case
Kn
radix sort worst case
Kn
Bubble sort application
sorting quickly
Selection sort application
sorting quickly
shell sort application
more efficient insertion sort
mergesort application
sorting on disk and in massive files
what is a trie
data structure used for location specific keys within a set
When is insertion sort best case
when the inner loop never executes
