type from 'pidgeonhole' to 'pigeonhole' sort

abranhe · abranhe · commit 7cf18d379bce · 2018-10-10T11:33:48.000-04:00
diff --git a/allalgorithms/sorting/pigeonhole_sort.py b/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
@@ -62,7 +62,7 @@ print(binary_search(arr, 3))
   - [Cocktail Shaker Sort](sorting/cocktail-shaker-sort)
   - [Insertion Sort](sorting/insertion-sort)
   - [Merge Sort](sorting/merge-sort)
-  - [Pidgeonhole Sort](sorting/pidgeonhole-sort)
+  - [Pigeonhole Sort](sorting/pigeonhole-sort)
   - [Selection Sort](sorting/selection-sort)
   - [Stooge Sort](sorting/stooge-sort)
 
diff --git a/docs/sorting/pigeonhole-sort.md b/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
@@ -62,7 +62,7 @@ print(binary_search(arr, 3))
   - [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)
-  - [Pidgeonhole Sort](https://python.allalgorithms.com/sorting/pidgeonhole-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)
 
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,7 +24,7 @@ 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):
+    def test_pigeonhole_sort(self):
         self.assertEqual([-44, 1, 2, 3, 7, 19], pidgeonhole_sort([7, 3, 2, 19, -44, 1]))
 
     def test_stooge_sort(self):

Original file line number	Diff line number	Diff line change
`@@ -1,14 +1,13 @@`
`1`	`1`	`# -- coding: UTF-8 --`
`2`	`2`	`#`
`3`		`-# Pidgeonhole Sort Algorithm`
	`3`	`+# Pigeonhole Sort Algorithm`
`4`	`4`	`# The All ▲lgorithms library for python`
`5`	`5`	`#`
`6`	`6`	`# Contributed by: Martmists`
`7`	`7`	`# Github: @martmists`
`8`	`8`	`#`
`9`	`9`
`10`		`-`
`11`		`-def pidgeonhole_sort(data):`
	`10`	`+def pigeonhole_sort(data):`
`12`	`11`	`minimum = min(data)`
`13`	`12`	`size = max(data) - minimum + 1`
`14`	`13`	`holes = [0] * size`