Back to course home
0% completed
Vote For New Content
We should try to come up with a solution better than O(n log)
brigadirden
Oct 24, 2023
But since the given list is sorted, we should try to come up with a solution better than O(n log).
This is really confusing - we should try, but in the end nothing said about it and we ending up with time complexity O(n).
0
0
Comments
Comments
D
davemednikov 2 years ago
O(n) is better than (n log n)
Design Gurus2 years ago
Can you elaborate your question?
The given solution is of O(N) which is better than O(N*logN).
On this page