[GSoC status report] Week 6

[Seb Ruiz]

2009/6/1 Teo Mrnjavac <teo.mrnjavac at gmail.com>:
> So I implemented kAdaptiveStableSort(),
> a simple generic adaptive sorting algorithm that should perform close
> to O(n) on a partially sorted input.

I'm a little clueless on the entire situation here, but is it not
possible to implement an O(nlogn) sorting algorithm to achieve the
results that you want?


-- 
Seb Ruiz

http://www.sebruiz.net/
http://amarok.kde.org/