Would this be faster if we not calculate powerset xs twice? I don't know how GHC... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		badbath on Dec 26, 2014 \| parent \| context \| favorite \| on: Powerset – recursive algorithm in Haskell Would this be faster if we not calculate powerset xs twice? I don't know how GHC works well enough so I ask.

gamegoblin on Dec 31, 2014 [–]

I'm pretty sure GHC will optimize that out since it's a pure function.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact