[Haskell-cafe] Re: looking for a good algorithm

Hong Yang wrote in article in gmane.comp.lang.haskell.cafe:

I want to shuffle the rows to maximize the number of columns whose first 100 rows have at least one number

Sounds like the maximum coverage problem, which is said to be NP-hard. [citation needed] http://en.wikipedia.org/wiki/Maximum_coverage_problem -- Edit this signature at http://www.digitas.harvard.edu/cgi-bin/ken/sig The answer to the ultimate question of life the universe and everything = 42 but usually it's not.