andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

i

Browse Source
This commit is contained in:
Rohit Tanwar
2018-01-09 11:29:02 +05:30
parent defe3913e0
commit ad813a5af6
2 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
README.md
View File

@ -8,9 +8,9 @@ Python implementation of 30-seconds-of-code.
### chunk
Chunks an array into smaller arrays of a specified size.
Chunks an array into smaller lists of a specified size.
Uses `range` to create a list of desired size. Then use `map` on this list and fill it with splices of `arr`
Uses `range` to create a list of desired size. Then use `map` on this list and fill it with splices of `arr`.
```python
from math import ceil
@ -26,6 +26,7 @@ def chunk(arr, size):
``` python
chunk([1,2,3,4,5],2) # [[1,2],[3,4],5]
```
### gcd
Calculates the greatest common divisor between two or more numbers/lists.
@ -68,7 +69,7 @@ gcd(8,36) # 4
Returns the least common multiple of two or more numbers.
Use the `greatest common divisor (GCD)` formula and the fact that `lcm(x,y) = x * y / gcd(x,y)` to determine the least common multiple. The GCD formula uses recursion.
kbc
Uses `reduce` function from the inbuilt module `functools`. Also defines a method `spread` for javascript like spreading of lists.
```python

2
snippets/lcm.md
View File

@ -3,7 +3,7 @@
Returns the least common multiple of two or more numbers.
Use the `greatest common divisor (GCD)` formula and the fact that `lcm(x,y) = x * y / gcd(x,y)` to determine the least common multiple. The GCD formula uses recursion.
k
Uses `reduce` function from the inbuilt module `functools`. Also defines a method `spread` for javascript like spreading of lists.
```python