...
| input size |
|
|
|
|
|
|---|---|---|---|---|---|---|
| 200 |
| 1000 |
| 5000 |
|
| up |
| up |
| up |
|
isort | down |
| down |
| down |
|
| rand |
| rand |
| rand |
|
| up |
| up |
| up |
|
qsort | down |
| down |
| down |
|
| rand |
| rand |
| rand |
|
COMP 280
introduces concepts of how these algorithms behave in general.
The punchline is that we can say that both insertion sort and
quicksort on lists are "_O(n
...