A proof I will never forget: An algorithms story

Dec 26, 2007 01:22

Many moons ago, I was taking computer science 344, Design and Analysis of Computer Algorithms at Rutgers. The simplicity and beauty of the subject matter was unmatched by anything else I'd studied except Newtonian mechanics, and algorithms, being based on mathematical formalisms rather than the messy physical universe, actually have the nice ( Read more... )

Leave a comment

Comments 3

that's.... edofthefu December 26 2007, 17:35:11 UTC
really clever! wow

Reply


anonymous June 16 2008, 08:44:12 UTC
this is the one nicest thing which i have ever read

Reply


anonymous January 9 2009, 20:08:19 UTC
Well thank you for sharing that!... I'm a CS student and I was just looking for a proof on the Element Uniqueness lower bound. All I got was a pretty complicated linear decision tree computation model. But this proof is beautiful...

Reply


Leave a comment

Up