Three Beautiful Quicksorts

From Google TechTalks · 1:00:40

Show by Google TechTalks

Google Tech TalksAugust 9, 2007ABSTRACTThis 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...Uploaded 08-10-07

More episodes of Google TechTalks

More episodes

PodSearch is a free, independent podcast search engine. Read about PodSearch, the privacy policy or contact us.