QuesHub > 更快 > 算法 > 堆栈 > ASK DETAIL

Is n log n greater than N?

Oliver Scott | 2023-06-17 12:09:22 | page views:1848
I'll answer
Earn 20 gold coins for an accepted answer.20 Earn 20 gold coins for an accepted answer.
40more

Zoe Gonzalez

Studied at the University of Tokyo, Lives in Tokyo, Japan.
Asymptotic complexities are about the behavior of the running time as the input sizes go to infinity. No, it will not always be faster. BUT, as the problem size grows larger and larger, eventually you will always reach a point where the O(log n) algorithm is faster than the O(n) one.Feb 9, 2012
2023-06-19 12:09:22

Benjamin Martin

QuesHub.com delivers expert answers and knowledge to you.
Asymptotic complexities are about the behavior of the running time as the input sizes go to infinity. No, it will not always be faster. BUT, as the problem size grows larger and larger, eventually you will always reach a point where the O(log n) algorithm is faster than the O(n) one.Feb 9, 2012
ask:3,asku:1,askr:137,askz:21,askd:152,RedisW:0askR:3,askD:0 mz:hit,askU:0,askT:0askA:4