2019-1: Chunky Monkey
Write a function that, given a scalar or vector as the right argument and a positive (>0) integer chunk size n as the left argument, breaks the array's items up into chunks of size n. If the number of elements in the array is not evenly divisible by n, then the last chunk will have fewer than n elements.
💡 Hint: The partitioned enclose function X⊂Y could be helpful for this problem.
Examples:
3 (your_function) ⍳9 ⍝ ]Box on is used to display the result
┌─────┬─────┬─────┐
│1 2 3│4 5 6│7 8 9│
└─────┴─────┴─────┘
3 (your_function) ⍳11
┌─────┬─────┬─────┬─────┐
│1 2 3│4 5 6│7 8 9│10 11│
└─────┴─────┴─────┴─────┘
10 (your_function) 'Dyalog'
┌──────┐
│Dyalog│
└──────┘
2 (your_function) 'The' 'cat' 'in' 'the' 'hat' 'sat' 'pat'
┌─────────┬────────┬─────────┬─────┐
│┌───┬───┐│┌──┬───┐│┌───┬───┐│┌───┐│
││The│cat│││in│the│││hat│sat│││pat││
│└───┴───┘│└──┴───┘│└───┴───┘│└───┘│
└─────────┴────────┴─────────┴─────┘
5 (your_function) '' ⍝ result is 0-element vector of text vectors
4 (your_function) 5
┌─┐
│5│
└─┘
your_function ←
Solutions
