Commit51ac5f5

authored

Merge pull requestabranhe#13 from abranhe/tree

Fix typo from 'pidgeonhole' to 'pigeonhole'

2 parentsa8ebdc7 +d8ddec4 commit51ac5f5Copy full SHA for 51ac5f5

File tree

+27

-17

lines changed

+27

-17

lines changed

Lines changed: 2 additions & 3 deletions

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`		`-defpidgeonhole_sort(data):`
	`10`	`+defpigeonhole_sort(data):`
`12`	`11`	`minimum=min(data)`
`13`	`12`	`size=max(data)-minimum+1`
`14`	`13`	`holes= [0]*size`

Lines changed: 9 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -55,10 +55,16 @@ print(binary_search(arr, 3))`
`55`	`55`
`56`	`56`	`#Tree`
`57`	`57`
`58`		`-- Searches`
	`58`	`+-###Searches`
`59`	`59`	`-[Binary Search](searches/binary-search)`
`60`		`-- Sorting`
`61`		`- - [Merge Sort](sorting/merge-sort)`
	`60`	`+-###Sorting`
	`61`	`+-[Bubble Sort](sorting/bubble-sort)`
	`62`	`+-[Cocktail Shaker Sort](sorting/cocktail-shaker-sort)`
	`63`	`+-[Insertion Sort](sorting/insertion-sort)`
	`64`	`+-[Merge Sort](sorting/merge-sort)`
	`65`	`+-[Pigeonhole Sort](sorting/pigeonhole-sort)`
	`66`	`+-[Selection Sort](sorting/selection-sort)`
	`67`	`+-[Stooge Sort](sorting/stooge-sort)`
`62`	`68`
`63`	`69`
`64`	`70`	`#Related`

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-#Pidgeonhole Sort`
	`1`	`+#Pigeonhole Sort`
`2`	`2`
`3`	`3`	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."
`4`	`4`
`@@ -11,17 +11,17 @@ pip install allalgorithms`
`11`	`11`	`##Usage`
`12`	`12`
`13`	`13`	```py
`14`		`-from allalgorithms.sortingimportpidgeonhole_sort`
	`14`	`+from allalgorithms.sortingimportpigeonhole_sort`
`15`	`15`
`16`	`16`	`arr= [77,2,10,-2,1,7]`
`17`	`17`
`18`		`-print(pidgeonhole_sort(arr))`
	`18`	`+print(pigeonhole_sort(arr))`
`19`	`19`	`# -> [-2, 1, 2, 7, 10, 77]`
`20`	`20`	```
`21`	`21`
`22`	`22`	`##API`
`23`	`23`
`24`		`-###pidgeonhole_sort(array)`
	`24`	`+###pigeonhole_sort(array)`
`25`	`25`
`26`	`26`	`>Returns a sorted array`
`27`	`27`

Lines changed: 9 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -55,11 +55,16 @@ print(binary_search(arr, 3))`
`55`	`55`
`56`	`56`	`#Tree`
`57`	`57`
`58`		`-- Searches`
	`58`	`+-###Searches`
`59`	`59`	`-[Binary Search](https://python.allalgorithms.com/searches/binary-search)`
`60`		`-- Sorting`
`61`		`- - [Merge Sort](https://python.allalgorithms.com/sorting/merge-sort)`
`62`		`-`
	`60`	`+-###Sorting`
	`61`	`+-[Bubble Sort](https://python.allalgorithms.com/sorting/bubble-sort)`
	`62`	`+-[Cocktail Shaker Sort](https://python.allalgorithms.com/sorting/cocktail-shaker-sort)`
	`63`	`+-[Insertion Sort](https://python.allalgorithms.com/sorting/insertion-sort)`
	`64`	`+-[Merge Sort](https://python.allalgorithms.com/sorting/merge-sort)`
	`65`	`+-[Pigeonhole Sort](https://python.allalgorithms.com/sorting/pigeonhole-sort)`
	`66`	`+-[Selection Sort](https://python.allalgorithms.com/sorting/selection-sort)`
	`67`	`+-[Stooge Sort](https://python.allalgorithms.com/sorting/stooge-sort)`
`63`	`68`
`64`	`69`	`#Related`
`65`	`70`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,7 +5,7 @@`
`5`	`5`	`insertion_sort,`
`6`	`6`	`merge_sort,`
`7`	`7`	`selection_sort,`
`8`		`-pidgeonhole_sort,`
	`8`	`+pigeonhole_sort,`
`9`	`9`	`stooge_sort,`
`10`	`10`	`cocktail_shaker_sort`
`11`	`11`	`)`
`@@ -24,8 +24,8 @@ def test_insertion_sort(self):`
`24`	`24`	`deftest_selection_sort(self):`
`25`	`25`	`self.assertEqual([-44,1,2,3,7,19],selection_sort([7,3,2,19,-44,1]))`
`26`	`26`
`27`		`-deftest_pidgeonhole_sort(self):`
`28`		`-self.assertEqual([-44,1,2,3,7,19],pidgeonhole_sort([7,3,2,19,-44,1]))`
	`27`	`+deftest_pigeonhole_sort(self):`
	`28`	`+self.assertEqual([-44,1,2,3,7,19],pigeonhole_sort([7,3,2,19,-44,1]))`
`29`	`29`
`30`	`30`	`deftest_stooge_sort(self):`
`31`	`31`	`self.assertEqual([-44,1,2,3,7,19],stooge_sort([7,3,2,19,-44,1]))`

Comments

(0)