|
|
|
|
|
|
by bluGill
17 days ago
|
|
|
That depends on what end ends. For a small N, very bad algorithms can still be plenty fast. Sometimes it can even be faster. Some of your lower O algorithms can have very terrible constant factors, which means they're terrible when N is small, but as N gets large. Big and small N different for different algorithms and hardware both. |
|
|