How about This

Will this work for a compression algorithm:

String of ASCI characters

convert these char's into their binary formatt 1's & 0's(consist of 8 bits)

Group the binary into groups of 4 bytes(32bits),

Convert each group into int values,

Would thsi give a good compression ratio, how do i go about creating the algorithm for this?

thanks,

kelvin

[394 byte] By [kelvindavies11a] at [2007-10-2 16:59:15]
# 1
What part of this compresses the data?
dubwaia at 2007-7-13 18:12:36 > top of Java-index,Other Topics,Algorithms...
# 2

if you change to chars into ASCI values and then you convert them to binary you'll have 16 1's and 0's.

if you combine the 16 1's and 0's together and then calculate the unicode of this you'll end up with one char?

?

i think

maybe/ maybe not?

thanks,

kelvin

kelvindavies11a at 2007-7-13 18:12:36 > top of Java-index,Other Topics,Algorithms...
# 3
just realised when you add teh two binary values together the answer would be greater than any values higheer (out of bounds of) the unicode tablewhoops ,kelvin
kelvindavies11a at 2007-7-13 18:12:36 > top of Java-index,Other Topics,Algorithms...
# 4

> if you change to chars into ASCI values and then you

> convert them to binary you'll have 16 1's and 0's.

>

> if you combine the 16 1's and 0's together and then

> calculate the unicode of this you'll end up with one

> char?

One 32 bit char?

dubwaia at 2007-7-13 18:12:36 > top of Java-index,Other Topics,Algorithms...
# 5
Maybe you should use assembler code for this.
asian_cajun_2000a at 2007-7-13 18:12:36 > top of Java-index,Other Topics,Algorithms...