Can't figure out how to merge two lists in the following way in Haskell:
INPUT: [1,2,3,4,5] [11,12,13,14] OUTPUT: [1,11,2,12,3,13,4,14,5]
I want to propose a lazier version of merge:
merge [] ys = ys merge (x:xs) ys = x:merge ys xs
For one example use case you can check a recent SO question about lazy generation of combinations. The version in the accepted answer is unnecessarily strict in the second argument and that's what is improved here.
1.4m articles
1.4m replys
5 comments
57.0k users