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 1, 2024 April 24, 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
Merge Sort is frequently classified as a "divide and conquer" sort because unlike many other sorts that sort data sets in a linear manner, Merge Sort breaks the data into small data sets, sorts those small sets, and then merges the resulting sorted lists together. This sort is usually more efficient than linear sorts because of the fact that it breaks the list in half repeatedly, thus allowing it to operate on individual elements in only log(n) operations, rather than the usual n2. Given the data (4 3 1 2) to sort, Merge Sort would first divide the data into two smaller arrays (4 3) and (1 2). It would then process the sub list (4 3) in precisely the same manner, by recursively calling itself on each half of the data, namely (4) and (3). When merge sort processes a list with only one element, it deems the list sorted and sends it to the merging process; therefore, the lists (4) and (3) are each in sorted order. Merge sort then merges them into the sorted list (3 4). The same process is repeated with sublist (1 2)--it is broken down and rebuilt in to the list (1 2). Merge Sort now has two sorted lists, (4 3) and (1 2) which it merges by comparing the smallest element in each list and putting the smaller one into its place in the final, sorted data set. Tracing how merge sort sorts and merges the subarrays it creates, makes the recursive nature of the algorithm even more apparent. Notice how each half array gets entirely broken-down before the other half does.
8 9 3 5 6 4 2 1 7 0
Sorting subarray: [ 8 9 3 5 6 4 2 1 7 0 ]
Sorting subarray: [ 8 9 3 5 6 ]
Sorting subarray: [ 8 9 ]
Sorting subarray: [ 8 ]
Sorting subarray: [ 9 ]
Merging SORTED subarrays ( 8 ) and ( 9 )
Sorting subarray: [ 3 5 6 ]
Sorting subarray: [ 3 ]
Sorting subarray: [ 5 6 ]
Sorting subarray: [ 5 ]
Sorting subarray: [ 6 ]
Merging SORTED subarrays ( 5 ) and ( 6 )
Merging SORTED subarrays ( 3 ) and ( 5 6 )
Merging SORTED subarrays ( 8 9 ) and ( 3 5 6 )
Sorting subarray: [ 4 2 1 7 0 ]
Sorting subarray: [ 4 2 ]
Sorting subarray: [ 4 ]
Sorting subarray: [ 2 ]
Merging SORTED subarrays ( 4 ) and ( 2 )
Sorting subarray: [ 1 7 0 ]
Sorting subarray: [ 1 ]
Sorting subarray: [ 7 0 ]
Sorting subarray: [ 7 ]
Sorting subarray: [ 0 ]
Merging SORTED subarrays ( 7 ) and ( 0 )
Merging SORTED subarrays ( 1 ) and ( 0 7 )
Merging SORTED subarrays ( 2 4 ) and ( 0 1 7 )
Merging SORTED subarrays ( 3 5 6 8 9 ) and ( 0 1 2 4 7 )
0 1 2 3 4 5 6 7 8 9
Please wait while we process your payment