Programming Exercise #2

Tolnaftate2004 · #1 01-15-2008, 04:02 AM

Quote:

Originally Posted by Novo

Still O(1)! I'm good.

With any luck, we should be able to get O(N!) [for single-word anagrams], or so, I'm thinking.

edit: Recursion can be used to get the arrangements, working on that...

Kristi · #2 01-15-2008, 04:23 AM

Quote:

Originally Posted by Tolnaftate2004

With any luck, we should be able to get O(N!) [for single-word anagrams], or so, I'm thinking.

The hard part is getting all of the arrangements in N!...

what does n represent

Tolnaftate2004 · #3 01-15-2008, 04:36 AM

Quote:

Originally Posted by Kristi

what does n represent

The length of the word passed.

Kristi · #4 01-15-2008, 05:31 AM

Quote:

Originally Posted by Tolnaftate2004

The length of the word passed.

yes but you also have to find which arrangements are actually words in the dictionary.... fun fun fun