Comment by Stormbringer
15 years ago
Wow. An order 0 sorting algorithm (it is O(0) not O(n) because it doesn't make _any_ comparisons). Amazing.
15 years ago
Wow. An order 0 sorting algorithm (it is O(0) not O(n) because it doesn't make _any_ comparisons). Amazing.
Just because a sorting algorithm doesn't use any comparisons doesn't make it O(0).
For example Radix Sort (http://en.wikipedia.org/wiki/Radix_sort) is not a comparison based sort and its complexity is O(k.n) where k is the max size of elements.
The OS scheduler still does the comparisons (and sorting). How otherwise would the threads wake up in order if they weren't sorted by somebody?