Talk:Last letter-first letter

From Rosetta Code
Revision as of 20:52, 5 June 2011 by rosettacode>MagiMaster (Created page with "==Number of names== This is equivalent to asking for the longest path in a directed graph, which is an NP-complete problem. That doesn't rule it out as a task, but running it on ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Number of names

This is equivalent to asking for the longest path in a directed graph, which is an NP-complete problem. That doesn't rule it out as a task, but running it on a graph with 646 nodes might take too long. Also, since it seems to be rare to use external files to store the data (or at least I haven't seen many tasks that call for that) having all the names in each example would get really cluttered. MagiMaster 20:52, 5 June 2011 (UTC)

Retrieved from "https://rosettacode.org/wiki/Talk:Last_letter-first_letter?oldid=186721"