|
ansuz.sooke.bc.ca/bonobo-conspiracy/?i=939
|
|
|
|
 | |  |
| OK, here's another new compression algorithm. | |
 | |  |
|
 |
| | |
| First we test whether the input is = to the string "banana"; if yes we just write out a single 1 bit. | |
| | |
|
|
|
|
|
|
|
| | |
| On sample inputs it should beat Burrows-Wheeler 9 times out of 10. | |
| | |
|
 |
|
|
|
#939 Orange you glad I didn't compress "banana" again
|
|
|
|
|
|
| | |
| You should test for "abracadabra" also. | |
| | |
|
|
|
