|
|
|
|
|
|
by Kubuxu
667 days ago
|
|
|
You could have an O(N^2) algorithm outperform an O(N) on the scale of 10,000 (or whatever scale you want to imagine). The big-O notation compares only asymptotic behaviour, and sometimes the lower power factors are overwhelming. |
|
|