From: Tobias Reif <tobiasreif@...>
Date: 2002-02-09T20:35:19+09:00
Subject: Re: Reg: tiny contest: who's faster? (add_a_gram)

Hi,

Reimer Behrends wrote:


> There are quite a few. A nice mixture of mathematical analysis and actual
> algorithms are Mehlhorn's "Data Structures and Efficient Algorithms" (see
> <URL:http://www.mpi-sb.mpg.de/~mehlhorn/DatAlgbooks.html>). Unlike some
> of the more basic books, it digs into more difficult topics like perfect
> hashing and planarity testing for graphs, but requires a solid
> mathematical background for that.
> 
> For more basic requirements, there are a ton of books out there --
> Sedgewick's probably being one of the most popular.


http://www.amazon.com/exec/obidos/ASIN/020140009X/

etc.?


> Note that the problems on the website you gave are all dynamic
> programming problems and can be solved almost trivially once you are
> aware of that fact.


Can you elaborate?
Do you mean that with the add-a-gram problem, one can stop as soon as 
the longest chain is found; or what do you mean by "dynamic" here?

Thanks,
Tobi



-- 

* peace&love.
* http://www.pinkjuice.com/