iritmaximus/haskell
1
0
Fork 0
mirror of https://github.com/iritmaximus/haskell.git synced 2026-10-12 19:13:39 +03:00
Code Issues Packages Projects Releases Wiki Activity

Set 10a Ex 7: clarify text

Browse Source
This commit is contained in:
Joel Kaasinen
2021-06-07 21:24:59 +03:00
parent 3ac0f330aa
commit f4edd6aaca
1 changed files with 5 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
exercises/Set10a.hs
+5 -1
View File
@@ -107,7 +107,11 @@ lengthAtLeast = todo
------------------------------------------------------------------------------
-- Ex 7: The function chunks should take in a list, and a number n,
-- and return all sublists of length n of the original list.
-- and return all sublists of length n of the original list. The
-- sublists should be in the order that they appear in the original
-- list. A sublist means a slice, that is, a list of elements
-- a,b,c,... that occur in the original list next to each other and in
-- the same order.
--
-- Make sure your function works with infinite inputs. The function
-- lengthAtLeast can help with this.