Under the same problem size n, the time complexity is O (nlog2n) algorithm on the execution time is always better than the time complexity is O () algorithm, the statement correct?

CodePudding user response:

I hope it can help you: https://blog.csdn.net/it_xiangqiang/category_10581430.html
I hope it can help you: https://blog.csdn.net/it_xiangqiang/category_10768339.html