Posted by Michele Covell & Shumeet Baluja, Research ScientistsEuro ITV (the interactive television conference) took place in Athens last week. The presentations included a diverse collection of user studies, new application areas, and exploratory business models. One of the main themes was the integration of multiple information sources. For example, during a time-out in a live sporting event, some viewers may enjoy reviewing highlight footage, while others may prefer to view a parallel program to view player profiles and statistics before...
Tuesday, 6 June 2006
Friday, 2 June 2006
Extra, Extra - Read All About It: Nearly All Binary Searches and Mergesorts are Broken
Posted on 08:34 by Unknown
Posted by Joshua Bloch, Software EngineerI remember vividly Jon Bentley's first Algorithms lecture at CMU, where he asked all of us incoming Ph.D. students to write a binary search, and then dissected one of our implementations in front of the class. Of course it was broken, as were most of our implementations. This made a real impression on me, as did the treatment of this material in his wonderful Programming Pearls (Addison-Wesley, 1986; Second Edition, 2000). The key lesson was to carefully consider the invariants in your programs.Fast forward...
Subscribe to:
Posts (Atom)
