Generating all permutations, combinations, and power set of a string (2012)

Re:Generating all permutations, combinations, and power set ... by lgas on Friday May 05, 2017 @03:39PM (#14276227)

In Haskell:

    import Data.List ( subsequences )
    powerset = subsequences

[ Parent | on HN ]

Re:Generating all permutations, combinations, and power set ... by RodgerTheGreat on Friday May 05, 2017 @03:51PM (#14276324)

It doesn't contribute much to the conversation to note that your favorite language has a canned procedure for solving an algorithmic problem like this. If you're genuinely interested in demonstrating Haskell's capabilities it would be far more constructive to offer an implementation of such a routine, that it might be compared directly to the others in the article and this thread.

[ Parent | on HN ]

Re:Generating all permutations, combinations, and power set ... by SteveBash on Sunday May 07, 2017 @11:06PM (#14288969)

There's a similar "canned procedure" a guy posted in python, why he wasn't judged with the same severity, is there some kind of bias against Haskell around here?

[ Parent | on HN ]

Re:Generating all permutations, combinations, and power set ... by lgas on Friday May 05, 2017 @05:59PM (#14277129)

We'll have to agree to disagree.

[ Parent | on HN ]