Create pigeonhole.py

[uppy19d0]

This code illustrates the Pigeonhole Sort algorithm:

• It first identifies the minimum and maximum values in the input array to determine the range of values.

• Then, it creates a "holes" list to keep track of the counts of each value.

• It counts the occurrences of each value in the input array and stores them in the corresponding "holes."

• Finally, it reconstructs the sorted array by placing the values back into the array according to the counts in the "holes."

• The code effectively sorts the input array using the Pigeonhole Sort algorithm, where values are redistributed into their correct positions.

[uppy19d0]

Sir, Please add the [hacktoberfest2023] , [hacktoberfest] and [hacktoberfest-accepted] Label. I will be very thankful to you.

[DhanushNehru]

Hi @uppy19d0 please update the main Readme.md

[uppy19d0]

s> Hi @uppy19d0 please update the main Readme.md

Done @DhanushNehru, please check the changes.