Suggestions
Use up and down arrows to review and enter to select.Please wait while we process your payment
If you don't see it, please check your spam folder. Sometimes it can end up there.
If you don't see it, please check your spam folder. Sometimes it can end up there.
Please wait while we process your payment
By signing up you agree to our terms and privacy policy.
Don’t have an account? Subscribe now
Create Your Account
Sign up for your FREE 7-day trial
Already have an account? Log in
Your Email
Choose Your Plan
Individual
Group Discount
Save over 50% with a SparkNotes PLUS Annual Plan!
Purchasing SparkNotes PLUS for a group?
Get Annual Plans at a discount when you buy 2 or more!
Price
$24.99 $18.74 /subscription + tax
Subtotal $37.48 + tax
Save 25% on 2-49 accounts
Save 30% on 50-99 accounts
Want 100 or more? Contact us for a customized plan.
Your Plan
Payment Details
Payment Summary
SparkNotes Plus
You'll be billed after your free trial ends.
7-Day Free Trial
Not Applicable
Renews May 9, 2024 May 2, 2024
Discounts (applied to next billing)
DUE NOW
US $0.00
SNPLUSROCKS20 | 20% Discount
This is not a valid promo code.
Discount Code (one code per order)
SparkNotes PLUS Annual Plan - Group Discount
Qty: 00
SparkNotes Plus subscription is $4.99/month or $24.99/year as selected above. The free trial period is the first 7 days of your subscription. TO CANCEL YOUR SUBSCRIPTION AND AVOID BEING CHARGED, YOU MUST CANCEL BEFORE THE END OF THE FREE TRIAL PERIOD. You may cancel your subscription on your Subscription and Billing page or contact Customer Support at custserv@bn.com. Your subscription will continue automatically once the free trial period is over. Free trial is available to new customers only.
Choose Your Plan
For the next 7 days, you'll have access to awesome PLUS stuff like AP English test prep, No Fear Shakespeare translations and audio, a note-taking tool, personalized dashboard, & much more!
You’ve successfully purchased a group discount. Your group members can use the joining link below to redeem their group membership. You'll also receive an email with the link.
Members will be prompted to log in or create an account to redeem their group membership.
Thanks for creating a SparkNotes account! Continue to start your free trial.
We're sorry, we could not create your account. SparkNotes PLUS is not available in your country. See what countries we’re in.
There was an error creating your account. Please check your payment details and try again.
Please wait while we process your payment
Your PLUS subscription has expired
Please wait while we process your payment
Please wait while we process your payment
Instead of real running time, we need to develop a notion of abstract time. To compute the abstract time, we'll count the number of abstract steps performed in an execution of the algorithm in question, or count the number of significant operations performed, such as comparisons, multiplications, copies, etc. This eliminates the dependence on technology and on implementation.
We can express abstract time as a function of the size of the input. Suppose that A is an algorithm and Input represents an input to A. Let | Input| = n be the size of Input. Then the number of steps processed while executing A given Input is A(Input).
Using this measure of complexity, let's look at an example. Let's say we have an algorithm that takes an array as input, and for each element in the array, it compares the element to every other element in the array. Furthermore, let's say we give the algorithm an array of 100 elements. It starts on the first element, and then looks at all the other 99 elements. Then it goes to the second element, and looks at all the other 99 elements. Etc. With our current metric, A(100) = = 100*99 = 9, 900.
We don't really want to compute A(Input) exactly. We want the dominant behavior of A(Input) for large inputs. We also want to ignore constant factors, as these are the least significant for measuring resource consumption and are very sensitive to exactly how we count steps in the algorithm. We want the order of magnitude of a time complexity function. In simple terms, we want the largest order of magnitude from the equation that describes the running time of the algorithm. For example, 5n2 + 12n - 3 would be expressed as n2 since n2 is the dominant term of the equation. As n grows very large, the rate of growth of the function depends on n2 more than any of the other terms, so that is all we care about. This statement is the result of asymptotic analysis.
Please wait while we process your payment