|
|
|
|
|
|
by Jweb_Guru
3583 days ago
|
|
|
The article points out that accessing n words of RAM takes O(nsqrt(n)), which is not dominated by O(n), which is my entire point here. And in the cache-oblivious model (for example), big-O notation is still alive and well; there are just additional variables introduced to account for the various constants. |
|
|