abranhe · abranhe · Oct 10, 2018 · Oct 10, 2018 · Oct 10, 2018 · Oct 10, 2018
diff --git a/allalgorithms/sorting/pidgeonhole_sort.py → allalgorithms/sorting/pigeonhole_sort.py b/allalgorithms/sorting/pidgeonhole_sort.py → allalgorithms/sorting/pigeonhole_sort.py
@@ -1,14 +1,13 @@
 # -*- coding: UTF-8 -*-
 #
-# Pidgeonhole Sort Algorithm
+# Pigeonhole Sort Algorithm
 # The All ▲lgorithms library for python
 #
 # Contributed by: Martmists
 # Github: @martmists
 #
 
-
-def pidgeonhole_sort(data):
+def pigeonhole_sort(data):
     minimum = min(data)
     size = max(data) - minimum + 1
     holes = [0] * size

diff --git a/docs/readme.md b/docs/readme.md
@@ -55,10 +55,16 @@ print(binary_search(arr, 3))
 
 # Tree
 
-- Searches
+- ### Searches
   - [Binary Search](searches/binary-search)
-- Sorting
-	 - [Merge Sort](sorting/merge-sort)
+- ### Sorting
+  - [Bubble Sort](sorting/bubble-sort)
+  - [Cocktail Shaker Sort](sorting/cocktail-shaker-sort)
+  - [Insertion Sort](sorting/insertion-sort)
+  - [Merge Sort](sorting/merge-sort)
+  - [Pigeonhole Sort](sorting/pigeonhole-sort)
+  - [Selection Sort](sorting/selection-sort)
+  - [Stooge Sort](sorting/stooge-sort)
 
 
 # Related

diff --git a/docs/sorting/pidgeonhole-sort.md → docs/sorting/pigeonhole-sort.md b/docs/sorting/pidgeonhole-sort.md → docs/sorting/pigeonhole-sort.md
@@ -1,4 +1,4 @@
-# Pidgeonhole Sort
+# Pigeonhole Sort
 
 Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number of elements (n) and the length of the range of possible key values (N) are approximately the same. It requires O(n + N) time. It is similar to counting sort, but differs in that it "moves items twice: once to the bucket array and again to the final destination [whereas] counting sort builds an auxiliary array then uses the array to compute each item's final destination and move the item there."
 
@@ -11,17 +11,17 @@ pip install allalgorithms
 ## Usage
 
 ```py
-from allalgorithms.sorting import pidgeonhole_sort
+from allalgorithms.sorting import pigeonhole_sort
 
 arr = [77, 2, 10, -2, 1, 7]
 
-print(pidgeonhole_sort(arr))
+print(pigeonhole_sort(arr))
 # -> [-2, 1, 2, 7, 10, 77]
 ```
 
 ## API
 
-### pidgeonhole_sort(array)
+### pigeonhole_sort(array)
 
 > Returns a sorted array
 

diff --git a/readme.md b/readme.md
@@ -55,11 +55,16 @@ print(binary_search(arr, 3))
 
 # Tree
 
-- Searches
+- ### Searches
   - [Binary Search](https://python.allalgorithms.com/searches/binary-search)
-- Sorting
-	 - [Merge Sort](https://python.allalgorithms.com/sorting/merge-sort)
-
+- ### Sorting
+  - [Bubble Sort](https://python.allalgorithms.com/sorting/bubble-sort)
+  - [Cocktail Shaker Sort](https://python.allalgorithms.com/sorting/cocktail-shaker-sort)
+  - [Insertion Sort](https://python.allalgorithms.com/sorting/insertion-sort)
+  - [Merge Sort](https://python.allalgorithms.com/sorting/merge-sort)
+  - [Pigeonhole Sort](https://python.allalgorithms.com/sorting/pigeonhole-sort)
+  - [Selection Sort](https://python.allalgorithms.com/sorting/selection-sort)
+  - [Stooge Sort](https://python.allalgorithms.com/sorting/stooge-sort)
 
 # Related
 

diff --git a/tests/test_sorting.py b/tests/test_sorting.py
@@ -5,7 +5,7 @@
     insertion_sort,
     merge_sort,
     selection_sort,
-    pidgeonhole_sort,
+    pigeonhole_sort,
     stooge_sort,
     cocktail_shaker_sort
 )
@@ -24,8 +24,8 @@ def test_insertion_sort(self):
     def test_selection_sort(self):
         self.assertEqual([-44, 1, 2, 3, 7, 19], selection_sort([7, 3, 2, 19, -44, 1]))
 
-    def test_pidgeonhole_sort(self):
-        self.assertEqual([-44, 1, 2, 3, 7, 19], pidgeonhole_sort([7, 3, 2, 19, -44, 1]))
+    def test_pigeonhole_sort(self):
+        self.assertEqual([-44, 1, 2, 3, 7, 19], pigeonhole_sort([7, 3, 2, 19, -44, 1]))
 
     def test_stooge_sort(self):
         self.assertEqual([-44, 1, 2, 3, 7, 19], stooge_sort([7, 3, 2, 19, -44, 1]))