Re: [PATCH] compat: Add simplified merge sort implementation from glibc

!MAILaRCHIVE_VOTE_RePLACE
Previous message: [thread] [date] [author]
Next message: [thread] [date] [author]
To: Brian Downing <bdowning@...>
Cc: Junio C Hamano <gitster@...>, Steffen Prohaska <prohaska@...>, <git@...>, <msysgit@...>
Date: Saturday, February 2, 2008 - 10:37 pm

Hi,

On Sat, 2 Feb 2008, Brian Downing wrote:


I should add that this is a stripped-down version of glibc's sort() (yes, 
the GPL of glibc allows that we rip it, for all you license wieners out 
there).

AFAIR the discussion about the different implementations of a sort 
algorithm boiled down to one particular implementation being quicker than 
what this patch has, but with dubious licensing, and the glibc 
implementation without the modifications present in this patch being 
slower.

So I would like this to go in, evidently, if only as a starting point for 
people to play with sorting algorithms, to find the one which is optimal 
for our general use (we have quite some uses where we put in _almost_ 
sorted data, which seems to be the worst-case for many sorting 
algorithms).

Ciao,
Dscho

-
To unsubscribe from this list: send the line "unsubscribe git" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Previous message: [thread] [date] [author]
Next message: [thread] [date] [author]

Messages in current thread:
Re: [PATCH] compat: Add simplified merge sort implementation..., Johannes Schindelin, (Sat Feb 2, 10:37 pm)
Re: [PATCH] compat: Add simplified merge sort implementation..., Johannes Schindelin, (Sun Feb 3, 5:09 pm)