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;
13 Cards in this Set
- Front
- Back
|
What is the worst case order of magnitude for a sequential search algorithm
|
(0)n
|
|
|
what is the worst case order of magnitude for a copy-over algorithm
|
(0)n
|
|
|
what is the worst case order of magnitude for a selection sort algorithm
|
(0)n^2
|
|
|
what is the worst case order of magnitude for shuffle left algorithm
|
(0)n^2
|
|
|
what is the worst case order of magnitude for bubble sort algorithm
|
(0)n^2
|
|
|
what is the worst case order of magnitude for converging points algorithm
|
(0)n
|
|
|
what is the worst case order of magnitude for binary search algorithm
|
(0)lgn
|
|
|
what is the definition of an algorithm
|
a well-ordered collection of unambiguous and effectively computable operations.
|
|
|
list the headings of the four different ways to study an algorithm
|
-their formal and mathematical properties
-their hardware realizations -their linguistic realizations -their applications |
|
|
what is the worst case input of the sequential search algorithm and how many comparisons are required in a search of N items in the case
|
-This algorithm does the same amount of work no matter how the numbers are initially arranged. It has no way of recognizing that the list might already be sorted.
-The number of comparisons required is n^2 |
|
|
what is the best case input of the converging-pointers algorithm, and how many copies are required with N items in the list
|
-the best case is a list containing no 0 elements.
-?? |
|
|
what is the best-case input of the copy-over algorithm, and how many copies are required with N items in the list
|
-the best case input is if all elements are 0
-(0)n copies need to be copied |
|
|
give the name of 3 classes of pseudocode
|
-sequential operations
-conditional operations -iterative operations |
