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. Practice
  2. Functional Programming
  3. Recursion
  4. String Mingling
  5. Discussions

String Mingling

  • nitinpatel278 + 1 comment

    Using recursion: 

    mingle "" "" = ""
mingle p q   = (head p) : (head q) : mingle (tail p) (tail q)

main = do
  p <- getLine
  q <- getLine
  putStrLn $ mingle p q
    • pedrosqueiroga + 1 comment

      did this pass? Without tail recursion, common-lisp fails at 9 and 10 (heap exhausted). And even with tail recursion, it fails at 10 because of the time limit, so I had to use a map, and no recursion, even though this is in the "recursion" section!!

      • nitinpatel278 + 0 comments

        Haskell solution did pass all the test cases. I don't know much about tail recursion to comment on that.