would this work better than bresenham?

function drawline(x0,y0,x1,y1){
dx = x1-x0
dy = y1-y0
len = sqrt(dx*dx+dy*dy)
dx /= len
dy /= len
    for (k=0;k<=len;k++){
        paint(floor(x0),floor(y0))
        x0 += dx
        y0 += dy
    }
}

Infinite compression is possible. I'm working on it(i just get distracting with inane stuff all the time like wordcounts,optimized drawline which is already implemented in hardware(Though it doesn't use my algorithm)).
>>27
You can't compress the representation to a byte.
 The representation of any compressed data is proportional to size of data PLUS overhead. At some point the overhead is the dominant component(each layer of compression adds own overhead).
Also, gains of compression depend on time and initial entropy/serial correlation.
Some data which is close to random noise will take a lot of time to compress.
>>28
>Hackers can turn your computer into a bomb.jpg
>>29
Sorry, Only C is accepted.