1. Re: compression
Hello Mike,
>If the data to be compressed is a text file then how about compressing the
>text in the
>headers? ie:
>a to z = 26
>A to Z = 26
>total 52 (5.7 BITS)
I want this to be a general purpose compression algorithm.
Not just for text.
> >I have got up to 17% compression with this.
I got 32% compression later on a different string.,
>Does that means that a 100k file was reduced to 83k or that 100k -> 17k?
It means that it was reduced BY 17%. like 100k going to 83k.
> >It finds all substrings that are repeated in a string of bytes
> >and sorts them by how many matches were found in descending
> > order.(This was done with Michael's code) Then I re-sort these
> >strings based on a "score"..
>
>Would it be possible to amalgamate the 2 sorting processes with a single
>comprehensive
>sort? ie, loop through each matched group and calculate the "score" then
>sort them (once)
Yes, this would probably make the algorithm faster but
probably not help (or hinder) the compression any.
later,
Lewis Townsend
________________________________________________________________________
Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com
