Thanks, guys! This one works perfectly. I was monkeying with similar logic but wasn't sure about syntax.
Michael --- On Sat, 4/4/09, Andrew Wagner <wagner.and...@gmail.com> wrote: From: Andrew Wagner <wagner.and...@gmail.com> Subject: Re: [Haskell-cafe] Combining sequences To: "michael rice" <nowg...@yahoo.com> Cc: haskell-cafe@haskell.org Date: Saturday, April 4, 2009, 8:56 PM Here's a pretty straightforward approach: combine [] ys = ys combine xs [] = xs combine (x:xs) (y:ys) | x <= y = x : combine xs (y:ys) | otherwise = y : combine (x:xs) ys On Sat, Apr 4, 2009 at 8:40 PM, michael rice <nowg...@yahoo.com> wrote: Is there a simple way to combine two sequences that are in ascending order into a single sequence that's also in ascending order? An example would be the squares [1,4,9,16,25..] combined with the cubes [1,8,27,64,125..] to form [1,1,4,8,9,16,25,27..]. Michael _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe