diff --git a/README.md b/README.md
index ceeffb853..86ef87bf4 100644
--- a/README.md
+++ b/README.md
@@ -67,6 +67,8 @@ chunk([1,2,3,4,5],2) # [[1,2],[3,4],5]
```
+:arrow_up: Back To Top
+
### compact
Removes falsey values from a list.
@@ -91,6 +93,8 @@ compact([0, 1, False, 2, '', 3, 'a', 's', 34]) # [ 1, 2, 3, 'a', 's', 34 ]
```
+:arrow_up: Back To Top
+
### count_occurences
:information_source: Already implemented via `list.count()`.
@@ -119,6 +123,8 @@ count_occurrences([1, 1, 2, 1, 2, 3], 1) # 3
```
+:arrow_up: Back To Top
+
### deep_flatten
Deep flattens a list.
@@ -156,6 +162,8 @@ deep_flatten([1, [2], [[3], 4], 5]) # [1,2,3,4,5]
```
+:arrow_up: Back To Top
+
### difference
Returns the difference between two arrays.
@@ -180,6 +188,8 @@ difference([1, 2, 3], [1, 2, 4]) # [3]
```
+:arrow_up: Back To Top
+
### shuffle
:information_source: The same algorithm is already implemented via `random.shuffle`.
@@ -217,6 +227,8 @@ shuffle(foo) # [2,3,1] , foo = [1,2,3]
```
+:arrow_up: Back To Top
+
### spread
Implements javascript's spread syntax as a function. Flattens the list(non-deep) and returns an list.
@@ -246,6 +258,8 @@ spread([1,2,3,[4,5,6],[7],8,9]) # [1,2,3,4,5,6,7,8,9]
```
+:arrow_up: Back To Top
+
### zip
:information_source: Already implemented via `itertools.zip_longest()`
@@ -280,6 +294,8 @@ zip(['a'], [1, 2], [True, False], fill_value = '_') # [['a', 1, True], ['_', 2,
```
+:arrow_up: Back To Top
+
## :scroll: String
### count_vowels
@@ -310,6 +326,8 @@ count_vowels('gym') # 0
```
+:arrow_up: Back To Top
+
## :heavy_division_sign: Math
### gcd
@@ -360,6 +378,8 @@ gcd(8,36) # 4
```
+:arrow_up: Back To Top
+
### lcm
Returns the least common multiple of two or more numbers.
@@ -410,6 +430,8 @@ lcm([1, 3, 4], 5) # 60
```
+:arrow_up: Back To Top
+
### max_n
Returns the `n` maximum elements from the provided list. If `n` is greater than or equal to the provided list's length, then return the original list(sorted in descending order).
@@ -441,6 +463,8 @@ max_n([1, 2, 3], 2) # [3,2]
```
+:arrow_up: Back To Top
+
### min_n
Returns the `n` minimum elements from the provided list. If `n` is greater than or equal to the provided list's length, then return the original list(sorted in ascending order).
@@ -471,6 +495,8 @@ min_n([1, 2, 3], 2) # [1,2]
```
+:arrow_up: Back To Top
+
## Credits
diff --git a/scripts/readme.py b/scripts/readme.py
index 65f0f8e4e..b4e3a5217 100644
--- a/scripts/readme.py
+++ b/scripts/readme.py
@@ -49,5 +49,5 @@ for category in tag_dict:
someFile = open("snippets/" + snippet + '.md')
fileData = someFile.read()
codeParts = re.split(codeRe,fileData)
- toAppend += codeParts[0] + f'```py{codeParts[1]} \n ```' +codeParts[2] + f'View Examples
\n\n```py\n{codeParts[3]}\n```\n \n' + '\n'
+ toAppend += codeParts[0] + f'```py{codeParts[1]} \n ```' +codeParts[2] + f'View Examples
\n\n```py\n{codeParts[3]}\n```\n \n\n:arrow_up: Back To Top\n ' + '\n'
open("README.md",'w').write(start+toAppend+'\n'+end)