Check out Smaz:
Smaz is a simple compression library suitable for compressing very short
strings.
More Related Contents:
- Best Compression algorithm for a sequence of integers
- Efficient way to add element to sorted datastructure [closed]
- How to count the number of set bits in a 32-bit integer?
- Algorithm to return all combinations of k elements from n
- Graph Algorithm To Find All Connections Between Two Arbitrary Vertices
- How do you detect Credit card type based on number?
- How does finding a cycle start node in a cycle linked list work?
- Negative weights using Dijkstra’s Algorithm
- What’s the fastest algorithm for sorting a linked list?
- Need help in mod 1000000007 questions
- SICP example: Counting change, cannot understand
- Check if one integer is an integer power of another
- Quicksort: Iterative or Recursive
- How best to sum up lots of floating point numbers?
- Algorithm to tell if two arrays have identical members
- Quicksort vs heapsort
- Find 2 numbers in an unsorted array equal to a given sum
- finding a^b^c^… mod m
- Algorithm to find the most common substrings in a string
- Simplest way to get the top n elements of a Scala Iterable
- Find cycle of shortest length in a directed graph with positive weights
- Random points inside a parallelogram
- How is 2D bin packing achieved programmatically?
- Optimizing Conway’s ‘Game of Life’
- Algorithm to find all Latitude Longitude locations within a certain distance from a given Lat Lng location
- How do ASCII art image conversion algorithms work? [closed]
- Reason for the number 5381 in the DJB hash function?
- What is the best algorithm for finding the closest color in an array to another color? [closed]
- Compute the area of intersection between a circle and a triangle?
- Quadratic algorithm for 4-SUM