Pigeonhole Sort

[unnatideshwal]

🚀 Feature

Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number of elements and the number of possible key values are approximately the same. It requires O(n + Range) time where n is number of elements in input array and ‘Range’ is number of possible values in array.

Have you read the Contribution Guidelines?

Yes

Pitch

Find minimum and maximum values in array. It is similar to counting sort, but differs in that it moves items twice.

Assignees

@arnav-roy - CPP @hritik5102 - Python @Bene98 - Java

[arnav-roy]

Kindly assign, I want to work in c++

[unnatideshwal]

@arnav-roy -C++

[hritik5102]

Hello @unnatideshwal , i would like to contribute to this issue.

• [x] Implementation of the pigeonhole sort using python

Thank you :)

[unnatideshwal]

@hritik5102 - Python

[hritik5102]

Hello @unnatideshwal , Please check PR #388

if any changes required, please let me know

Thank you

[Bene98]

Hey, can I implement this in java?

[niranjantuty]

@Bene98 - Java Assigned. Go ahead :)

[arnav-roy]

Hello @unnatideshwal , Please check PR #426

If any changes required, please let me know.

Thank you.