Using Haskell,

define a function shuffle :: Int -> [a] -> [a] that takes a natural number n and an even-lengthed list, and splits and then interleaves the list n times. For example, shuffle 2 [1,2,3,4,5,6] = [1,5,4,3,2,6].