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.
You may also like
2.73K Views0 Comments0 Likes
Cloud computing shouldn't be an either/or decision. We should definitely make use of the tremendous collaborative possibilities of the Web for some tasks but utilize "the awesome local, graphical power and computing p...