Lynda.com is now LinkedIn Learning!

To access Lynda.com courses again, please join LinkedIn Learning

All the same Lynda.com content you know and love

Plus personalized recommendations and LinkedIn Career access   

All for the same price as Lynda! Get a 1-month free trial today.

Try LinkedIn Learning for free
Questions? Visit our help center.
Skip navigation
Merge sort: Four Semesters of Computer Science in 5 Hours
Merge sort: Four Semesters of Computer Science in 5 Hours

Merge sort is a divide and conquer algorithm that uses recursion to divide a list into smaller pieces for sorting. This division continues until you have a list of one. After introducing merge sort, Brian also explains the need for a stitching function and talks about merge sort’s Big O and spacial complexity.

Resume Transcript Auto-Scroll
Skill Level Intermediate
4h 46m
Duration
158,811
Views
Show More Show Less

Continue Assessment

You started this assessment previously and didn't complete it. You can pick up where you left off, or start over.

Start My Free Month

Start your free month on LinkedIn Learning, which now features 100% of Lynda.com courses. Develop in-demand skills with access to thousands of expert-led courses on business, tech and creative topics.

Start My Free Month

You are now leaving Lynda.com and will be automatically redirected to LinkedIn Learning to start your free trial.