We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a2ee788 commit 3c6459aCopy full SHA for 3c6459a
Sorting/Pigeonhole Sort/Python/README.md
@@ -0,0 +1,5 @@
1
+# Pigeonhole sorting
2
+It is a sorting algorithm that is suitable for sorting lists of elements where the number of elements and
3
+the number of possible key values are approximately the same.
4
+
5
+It requires O(n + Range) time where n is number of elements in input array and ‘Range’ is number of possible values in array.
0 commit comments