Skip to content

Commit 3c6459a

Browse files
Create README.md
1 parent a2ee788 commit 3c6459a

File tree

1 file changed

+5
-0
lines changed

1 file changed

+5
-0
lines changed
Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -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

Comments
 (0)