Material Detail

Lecture 16: Partitioning for Quicksort

Lecture 16: Partitioning for Quicksort

This video was recorded at Stanford Engineering Everywhere CS106B - Programming Abstractions. 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

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as Lecture 16: Partitioning for Quicksort

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.
hidden