Lecture 16: Partitioning for Quicksort
author: Julie Zelenski,
Computer Science Department, Stanford University
published: Nov. 15, 2010, recorded: January 2008, views: 2362
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
published: Nov. 15, 2010, recorded: January 2008, views: 2362
released under terms of: Creative Commons Attribution Non-Commercial (CC-BY-NC)
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
So I expect to take a little bit more, but I'm always open to figure out what really happened there. So let’s, we’ll start with something ridiculous, but just in case somebody was just super hot, did anybody manage to finish [inaudible] with less than ten hours, a total start to finish – hey I like to see that. ...
See the whole transcript at Programming Abstractions - Lecture 16
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: