|
|
|
|
|
|
by jorgemf
3281 days ago
|
|
|
As far as I understood, the base algorithm is the same which has an average case of n log(n). The new algorithms only try to improve the pivot selection to avoid the worst cases and try to be better than the average case for most practical cases. But at the end there are not new algorithms improving the limit of n log(n). |
|
|