0
I am interested in splitting any list into consecutive subsets based on a k-value. For example, [1,2,3,4,5] splits into [[1,2],[2,3],[3,4],[4,5]] when k=2. If k is bigger than the entire list, then an empty list will be returned.
I have written code in both J and Haskell that performs this task...