Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number n of elements and the length N of the range of possible key values are approximately the same. It requires O(n + N) time.
Feature : -
Add Pigeonhole sort in C++ , C , java , python.
Description of solution :-
Will add Pigeonhole sort with adequate comments and proper documentation for readers to get a clear understanding.
To be added in C, C++, Java and Python.
Alternatives Considered :
Can you please assign me (@Kumar-laxmi ) this issue under SSoC'23
Pigeonhole sort:-
Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number n of elements and the length N of the range of possible key values are approximately the same. It requires O(n + N) time.
Feature : -
Description of solution :-
Alternatives Considered :
Can you please assign me (@Kumar-laxmi ) this issue under SSoC'23