Busy. Please wait.
or

show password
Forgot Password?

Don't have an account?  Sign up 
or

Username is available taken
show password

why


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account.
We do not share your email address with others. It is only used to allow you to reset your password. For details read our Privacy Policy and Terms of Service.


Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.

Remove ads
Don't know
Know
remaining cards
Save
0:01
To flip the current card, click it or press the Spacebar key.  To move the current card to one of the three colored boxes, click on the box.  You may also press the UP ARROW key to move the card to the "Know" box, the DOWN ARROW key to move the card to the "Don't know" box, or the RIGHT ARROW key to move the card to the Remaining box.  You may also click on the card displayed in any of the three boxes to bring that card back to the center.

Pass complete!

"Know" box contains:
Time elapsed:
Retries:
restart all cards




share
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

2 - Analysis

Problem Solving with Algorithms and Data Structures(Python)

QuestionAnswer
average case algorithm performs somewhere in between these two extremes
Big-O notation order of magnitude; used to compare efficiency of algorithms
brute force technique for solving a problem typically tries to exhaust all possibilities
checking off to determine and keep track of whether certain conditions are met by multiple pieces of data
exponential O(2^n); function that grows extremely fast
linear O(n); polynomial of degree one; straight line
log linear O(n log n); a function whose growth is somewhere between logarithmic and quadratic
logarithmic O(log n); slowest growing function
order of magnitude a function that describes the part of T(n) that increases the fastest as the value of n increases
quadratic O( n^2 ); polynomial of degree one
time complexity refers to the amount of time it takes an algorithm to run; represented in Big-O notation.
worst case refers to a particular data set where the algorithm performs especially poorly
Created by: shoemaker