Jayanta's avatar
http://www.stumbleupon.com/redirect.php?t=ju=9680844d=http%3A%2F%2Fwww.stumbleupon.com%2Fjoin.php%3Ffriend%3D2232322%26emailcode%3Dh3kjpse6y5f1n88pl=1c=h3kjpse6y5f1n88p
Hi,
Jayanta is a member of StumbleUpon and would like
to send you an invitation. With StumbleUpon you
can
Ads???
On Thu, Jun 26, 2008 at 5:00 PM, [EMAIL PROTECTED] wrote:
[image: Jayanta's
avatar]http://www.stumbleupon.com/redirect.php?t=ju=9680844d=http%3A%2F%2Fwww.stumbleupon.com%2Fjoin.php%3Ffriend%3D2232322%26emailcode%3Dh3kjpse6y5f1n88pl=1c=h3kjpse6y5f1n88p
Hi,
Jayanta is a
There are plenty of games on net, where You have fixed (randomly
generated) letters (let's say fifteen of them) and You have to make up
as many valid words You can.
There are some constraints, like word must bet nominative noun, but it
doesn't really matters, You count on external word-list.
What kind of search algorithm you've used?
On 6/26/08, dingo [EMAIL PROTECTED] wrote:
There are plenty of games on net, where You have fixed (randomly
generated) letters (let's say fifteen of them) and You have to make up
as many valid words You can.
There are some constraints, like word
Could the original question be missing something, like the
specification of the rectangle being a longer operation, such as O(log
n)?
A dominance relationship structure (storage: O(n^2)) has, after you
use inclusion/exclusion to specify the rectangle, a query time of
O(1). Could that be what he
