A good sort algorithm because it is so compact and easy to code
1%
2
A good sort algorithm because it is blazing fast
0%
0
A reasonable sort algorithm because the time needed to sort N items increases linearly (i.e. if we increase the number of items to sort by 10x, we also increase the time needed by 10x)
A reasonable sort algorithm because the time needed to sort N items increases linearly (i.e. if we increase the number of items to sort by 10x, we also increase the time needed by 10x)
0%
0
Our "gold standard of badness" for sorting because if you increase the number of items to sort by 10x, you increase the time needed by 100x (N^2)
