Skip to content

Conversation

Aashu-11
Copy link

@Aashu-11 Aashu-11 commented Oct 2, 2024

Huffman Encoding is a popular algorithm used for lossless data compression. It reduces the size of data by assigning variable-length codes to input characters, with shorter codes assigned to more frequent characters. In Huffman Encoding, the algorithm makes the greedy choice by repeatedly combining the two least frequent nodes (characters) to build the Huff Also I am a beginner in Hacktoberfest so please do consider my request and merge it as soon as possible.

Regards,
Aayush Kolte.

  • I have read CONTRIBUTING.md.
  • This pull request is all my own work -- I have not plagiarized it.
  • All filenames are in PascalCase.
  • All functions and variable names follow Java naming conventions.
  • All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
  • All new code is formatted with clang-format -i --style=file path/to/your/file.java

Huffman Encoding is a popular algorithm used for lossless data compression and I am a beginner in Hacktoberfest so please do consider my request and merge it as soon as possible.
@Aashu-11
Copy link
Author

Aashu-11 commented Oct 2, 2024

@Owners please approve and merge my request as soon as possible.

@Aashu-11 Aashu-11 closed this Oct 3, 2024
@Aashu-11 Aashu-11 deleted the Aashu-11-patch-1 branch October 3, 2024 16:18
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants