Hello FPC-Pascal,

Tuesday, May 24, 2011, 1:06:43 PM, you wrote:

 >> Why is TimSort specially interesting to you ?
MG>  I need a fast stable sort, so multiple sorts work as expected (contrary to
MG> QuickSort).
MG>  TimSort is a candidate.

That's exactly the answer I was looking for, the stability need ;)
I'll try to write an implementation to expand my sorters collection :)
but the algo seems quite "confuse" and plenty of "tricks".

-- 
Best regards,
 José

_______________________________________________
fpc-pascal maillist  -  fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-pascal

Reply via email to