Study your flashcards anywhere!
Download the official Cram app for free >
 Shuffle
Toggle OnToggle Off
 Alphabetize
Toggle OnToggle Off
 Front First
Toggle OnToggle Off
 Both Sides
Toggle OnToggle Off
 Read
Toggle OnToggle Off
How to study your flashcards.
Right/Left arrow keys: Navigate between flashcards.right arrow keyleft arrow key
Up/Down arrow keys: Flip the card between the front and back.down keyup key
H key: Show hint (3rd side).h key
A key: Read text to speech.a key
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 copyover 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 wellordered 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 convergingpointers 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 bestcase input of the copyover 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 