Shared Flashcard Set

Details

Algorithm Runtimes
Best, average, worst cases.
27
Computer Science
Undergraduate 3
05/02/2011
Click here to study/print these flashcards.

Create your own flash cards! Sign up here.

Additional Computer Science Flashcards

 

 

Cards

Term
MERGE SORT - Best
 Definition
n lg(n)
Term
MERGE SORT - Average
 Definition
n lg(n)
Term
MERGE SORT - Worst
 Definition
n lg(n)
Term
HEAP SORT - Best
 Definition
n lg(n)
Term
HEAP SORT - Average
 Definition
n lg(n)
Term
HEAP SORT - Worst
 Definition
n lg(n)
Term
QUICK SORT - Best
 Definition
n lg(n)
Term
QUICK SORT - Average
 Definition
n lg(n)
Term
QUICK SORT - Worst
 Definition
n^2
Term
RADIX SORT - Best
 Definition
d n, where d = number of digits
Term
RADIX SORT - Average
 Definition
d n, where d = number of digits
Term
RADIX SORT - Worst
 Definition
d n, where d = number of digits
Term
COUNT SORT - Best
 Definition
n
Term
COUNT SORT - Average
 Definition
n
Term
COUNT SORT - Worst
 Definition
n
Term
INSERTION SORT - Best
 Definition
n
Term
INSERTION SORT - Average
 Definition
n^2
Term
INSERTION SORT - Worst
 Definition
n^2
Term
BUBBLE SORT - Best
 Definition
n (modified)
n^2 (unmodified)
Term
BUBBLE SORT - Average
 Definition
n^2
Term
BUBBLE SORT - Worst
 Definition
n^2
Term
BUCKET SORT - Best
 Definition
n
Term
BUCKET SORT - Average
 Definition
n + k, where k = number of buckets.
Term
BUCKET SORT - Worst
 Definition
n^2
Term
SELECTION SORT - Worst
 Definition
n^2
Term
SELECTION SORT - Average
 Definition
n^2
Term
SELECTION SORT - Best
 Definition
n (modified)
n^2 (unmodified)
Supporting users have an ad free experience!