5,337
edits
Parallel Algorithms: Difference between revisions
→Integer Sorting
No edit summary |
|||
| Line 185: | Line 185: | ||
==Integer Sorting== | ==Integer Sorting== | ||
There is a theorem that sorting with only comparisons is worst case at least <math>O(n\log n)</math><br> | |||
Input: Array A[1..n], integers are range [0..r-1]<br> | |||
==Resources== | ==Resources== | ||