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 3, 2024 April 26, 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
Problem : Consider the case where every pivot quick sort picks divides the list into one empty list and one list containing elements all greater than the pivot. This degenerate case of quick sort is equivalent to which other sorting algorithm?
Insertion sort, which finds iteratively takes the smallest element of the remaining unsorted portion of the list and places it at the front.Problem : Explain why a sophistocated pivot selection method can be helpful to the efficiency of quick sort.
Quick sort relies on picking a good pivot. If every pivot picks divides its list approximately in half, the sort will run in close to O(nlog(n)) time. The small amount of time taken in picking a good pivot is saved in the efficiency gained from making bad pivots unlikely.Problem : Consider the implementation of quick sort given in the summary. Why is that implementation inefficient for the list: (9, 8, 7, 6, 5, 4, 3, 2, 1)?
Since the given implementation chooses the first element of the list as the pivot, it chooses bad pivots for this data set.Problem : Why don't we just search through the data set each time we need to find a pivot and select one that will divide the data set roughly in half?
This strategy requires O(n) time to search through an n element list. Quick sort's efficiency relies on being able to pick a pivot quickly (which generally means in constant time).Problem : In terms of big-O notation, is quick sort's best case any better than merge sort?
No, they are both O(nlog(n))Please wait while we process your payment