IMPORTANT (please read): There are several errors in this video concerning the space complexity. Please make sure annotations are on to see the issues addressed as they come up. Thank you to YouTube user Simpletongeek for informing me about these!
ERRATA:
- The "real" version of quicksort we've seen is not actually in-place. Instead, due to the recursion, it uses O(log n) space.
- Only each individual call is O(1).
- For this version of simplified quicksort, each individual call is O(n) in space.
We revisit sorting algorithms to look at an easier way to approach quicksort.
= 0612 TV =
0612 TV is your one stop for general geekery! Learn about a variety of technology-related subjects, including Photography, General Computing, Audio/Video Production and Image Manipulation! Enjoy your stay, and don't hesitate to drop me a comment or a personal message to my inbox =) If you like my work, don't forget to subscribe!
More about me: http://about.me/lcc0612
Official Twitter: http://twitter.com/0612tv
