| n | nlogn | n2 |
|---|---|---|
| 10 | 23 | 100 |
| 100 | 461 | 10,000 |
| 1,000 | 6,908 | 1,000,000 |
| 10,000 | 92,103 | 100,000,000 |
| 100,000 | 1,151,293 | 10,000,000,000 |
| 1,000,000 | 13,815,511 | 1,000,000,000,000 |
If you could handle a card in a microsecond (one millionth of a second), merge sort on n = 1,000,000 would take about 14 seconds.
For selection sort: about 278 hours