|
|
|
| Aside: An Open Question on Lower |
||
| Bounds for Sorting |
||
|
|
|
|
|
|
| How
long does it take to a sort |
|||||
| an
n-by-n table of numbers? |
|||||
| • | O(n2log n) because there are |
||||
| n2
numbers in the table |
|||||
|
|
|
|
|
| What
if it’s an addition table? |
||||
| • | Shouldn’t
it be easier to sort |
|||
| than
an arbitrary table? |
||||
| CS409 - Spring
2000 |
| 6 |