Re: [PATCH WIP] sha1-lookup: make selection of 'middle' less aggressive

On Dec 30, 2007 10:49 PM, Junio C Hamano [off-list ref] wrote:

Linus Torvalds [off-list ref] writes:


The cost of the key comparison done in each round is
insignificant compared to the actual cost of accessing the
object data through zlib.

Sorry to ask, but just out of curiosity, what were the reasons to
choose zlib compression algorithm among the possible ones?

There is a thread where this has been discussed in the past? Sorry to
ask but I didn't find such a thread myself.

Thanks
Marco