Three Beautiful Quicksorts
  • Video is free for view
View_video

This talk describes three of the most beautiful pieces of code that I have ever written: three different implementations of Hoare's classic Quicksort algorithm. The first implementation is a bare-bones function in about a dozen lines of C. The second implementation starts by instrumenting the first program to measure its run time; a dozen systematic code transformations proceed to make it more and more powerful yet more and more simple, until it finally disappears in a puff of mathematical smoke. It therefore becomes the most beautiful program I never wrote. The third program is an industrial-strength C library Qsort function that I built with Doug...

Google Tech Talks
August 9, 2007



 

Tags: quicksorts, beautiful, Howto, three, Google Tech Talks, C and C++, Computer Science, Science, Development, Techtalks, Conferences, Google, Companies

Level: any Date: July 04, 2009 Votes: 0 User: Dmytro Shteflyuk  Comments:
 
 

No Response(s) to this entry

Subscribe to comments with RSS.