undefined | Better HN

story

0 pointsMaxBarraclough5y ago0 comments

> only applies when using the traditional greater/less than comparison model

What do you mean by this?

0 comments

brmgb5y ago

The 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.

Right, comparative and non-comparative sorting algorithms.

I'd say radix sort is the canonical example of a non-comparative sorting algorithm.

j / k navigate · click thread line to collapse

brmgb5y ago

The 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.

Right, comparative and non-comparative sorting algorithms.

I'd say radix sort is the canonical example of a non-comparative sorting algorithm.

j / k navigate · click thread line to collapse