Huffman Coding using Greedy Approach

[abhisheks008]

Related Issue #214

🔴 Issue Name : Huffman Coding [Directory : Greedy Algorithm]

• Hacktoberfest2022 Participant
• Contributor

Closes: #214

Description :

Created a Python script using the Greedy method to find out the Huffman code of each characters presented in the list in an ascending order.

Type of change

What sort of change have you made:

• Bug fix (non-breaking change which fixes an issue)
• New feature (non-breaking change which adds functionality)
• Code style update (formatting, local variables)
• Breaking change (fix or feature that would cause existing functionality to not work as expected)
• This change requires a documentation update

How Has This Been Tested?

This script or code has been tested using various test cases and scenarios.

Checklist:

• My code follows the guidelines of this project.
• I have performed a self-review of my own code.
• I have commented my code, particularly whereever it was hard to understand.
• I have made corresponding changes to the documentation.
• My changes generate no new warnings.
• I have added test cases that prove my fix is effective or that my feature works.

[prathimacode-hub]

PR approved. Keep going. 🎉✔@abhisheks008