3 ms·
> only applies when using the traditional greater/less than comparison model What do you mean by this?
by MaxBarraclough 6y ago
> only applies when using the traditional greater/less than comparison model
What do you mean by this?
- brmgb 6y agoThe bound is a bound on comparaison sort not a general bound on sorting. If you don't use comparaison you can sort faster. Pigeonhole sort is linear for example.
- MaxBarraclough 6y agoRight, comparative and non-comparative sorting algorithms. I'd say radix sort is the canonical example of a non-comparative sorting algorithm.