Skip to content

Add Compression Algorithm #136

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 6 commits into from
Mar 31, 2018
Merged

Conversation

shikhart98
Copy link
Contributor

@shikhart98 shikhart98 commented Oct 3, 2017

#96
In this compression algorithm I have used Generic Heap. You will see there are 3 files (.java), in which first is Generic Heap, second is the compressClient (used to take input and display output) , third is the HEncoder , which have functions like compress and decompress ( these functions are called from the compressionClient ). Following are some screenshots of the running algorithm.

  1. Input
    inputcompress

  2. Compressed Output
    compressed

  3. Checking the compressed output into Decompress function(we should get our previous input)
    decompress

Input : Source base , Source number , Destination base
Output : Destination Number
@dynamitechetan
Copy link
Member

Hi @shikhart98 AnytoAny file does not end with a .java extension. Also there are no code comments. Can you please update this? Thanks ;)

@shikhart98
Copy link
Contributor Author

shikhart98 commented Oct 21, 2017 via email

@dynamitechetan
Copy link
Member

Hi. The Algorithm is good. Please add some comments and please remove the bin directory.

@shikhart98
Copy link
Contributor Author

Hey I have added the comment to this code! kindly review and merge :)

@shikhart98
Copy link
Contributor Author

Can anyone please review my code! its commented now!

@christianbender christianbender merged commit 9ad263f into TheAlgorithms:master Mar 31, 2018
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.

6 participants