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.
  1. Prepare
  2. Functional Programming
  3. Recursion
  4. Functions and Fractals - Recursive Trees
  5. Discussions

Functions and Fractals - Recursive Trees

  • denizsayin
     + 0 comments

    Can be super concise in Haskell!

    splitNodeAt j seglen = map (\x -> [j - x, j + x]) [1..seglen]

treeColumns _ 0 _ = [[]]
treeColumns j segLen d = 
    (if d > 0
        then replicate segLen [j] ++ splitNodeAt j segLen
        else replicate (2 * segLen) [])
    ++ zipWith (++) (treeColumns (j - segLen) (segLen `div` 2) (d - 1))
		                          (treeColumns (j + segLen) (segLen `div` 2) (d - 1))

generateLine len indices = map (\i -> if i `elem` indices then '1' else '_') [0..len-1]

main = getLine >>= (putStrLn . unlines . reverse . map (generateLine 100) . treeColumns 49 16 . read)