1
vote
Sorting rational numbers in linear time
You can sort an array in linear time if the set of possible array elements is finite. Because in that case you just pick the array elements that have the smallest possible value, then the array ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
sorting × 913algorithms × 534
algorithm-analysis × 158
time-complexity × 104
runtime-analysis × 92
quicksort × 73
arrays × 68
data-structures × 55
complexity-theory × 51
lower-bounds × 34
radix-sort × 32
efficiency × 30
mergesort × 28
asymptotics × 26
optimization × 23
graphs × 21
heaps × 21
comparison × 20
search-algorithms × 17
permutations × 17
randomized-algorithms × 16
reference-request × 15
strings × 13
correctness-proof × 13
greedy-algorithms × 11