We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Functional Programming
  3. Recursion
  4. Pascal's Triangle
  5. Discussions

Pascal's Triangle

  • QuomoZ + 1 comment

    Pretty much the same thing I did, minus self-recursive definition shenanigans:

    pascal = iterate ((++ [1]) . (1:) . (zipWith (+) =<< tail)) [1]
    • yolanvanderhorst + 1 comment

      Bases on your solutions and adding a bit of my own, I think this might be the shorstest way to solve this, using just the Prelude:

      main=interact$unlines.map (unwords.(map show)).flip take s.read
s=[1]:map ((1:).(++[1]).(zipWith (+)=<<tail)) s
      • QuomoZ + 0 comments

        I could come up with a shorter one, here is your s function without spaces:

        s=[1]:map((1:).(++[1]).(zipWith(+)=<<tail))s

        which is longer by 5 characters than:

        p=[1]:[1:zipWith(+)r t++[1]|r@(_:t)<-p]