Heads up! To view this whole video, sign in with your Courses account or enroll in your free 7-day trial. Sign In Enroll
Well done!
You have completed Introduction to Data Structures!
You have completed Introduction to Data Structures!
Preview
The next step in the merge sort algorithm is the divide step, or rather an implementation of the split function.
This video doesn't have any notes.
Related Discussions
Have questions about this video? Start a discussion with the community and Treehouse staff.
Sign upRelated Discussions
Have questions about this video? Start a discussion with the community and Treehouse staff.
Sign up
Down here we'll call this
split like before and
0:00
this is going to take a linked_list.
0:01
Documenting things is good and we've been
doing it so far, so lets add a doc strong.
0:06
Divide the unsorted list
at midpoint into sublists.
0:11
Now, of course, when I say sublists here,
I mean sub-linked lists, but
0:19
that's a long word to say.
0:23
Now, here's where things start to
deviate from the previous version.
0:25
With the list type, we could rely on
the fact that finding the midpoint
0:29
You need to sign up for Treehouse in order to download course files.
Sign upYou need to sign up for Treehouse in order to set up Workspace
Sign up