Given a set represented as a String, we can compute its powerset using foldLeft, as shown below.
Isn’t this approach quite concise and elegant? Following snippet shows a pretty-printed output from powerset for a set: "abc".
scala> powerset("abc").toList sortWith ( _ < _) mkString "\n"
res3: String = "
| a
| ab
| abc
| ac
| b
| bc
| c"
Following is a F# implementation of this same function.
