Skip navigation

Exercise 5: Quicksort

Exercise 5: Quicksort: Four Semesters of Computer Science in 5 Hours
Exercise 5: Quicksort: Four Semesters of Computer Science in 5 Hours

In this exercise, you must create a quickSort() function that will grab a pivot from the end of the list and create two lists of values that are greater than and lesser than the pivot. The function will then recursively execute on these subsequent lists until all values are sorted and concatenated back into a single list.

Resume Transcript Auto-Scroll
Skill Level Intermediate
4h 46m
Duration
128,667
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