Skip navigation
Quicksort: Four Semesters of Computer Science in 5 Hours
Quicksort: Four Semesters of Computer Science in 5 Hours

Quicksort is one of the most useful and powerful sorting algorithms. Like merge sort, quicksort uses recursion to divide and conquer. The last element in the list is used as the “pivot." Everything smaller than the pivot is placed in a “left” list. Larger values are placed in a “right” list. Quicksort is then performed again on the left and right lists.

Resume Transcript Auto-Scroll
Skill Level Intermediate
4h 46m
Duration
77,527
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 Your Free Trial Now

Start your free trial now, and begin learning software, business and creative skills—anytime, anywhere—with video instruction from recognized industry experts.

Start Your Free Trial Now