Mohit Ashliya
Reputation: 635
Which time-complexity is better O(logM + logN) or O(logM.logN)?
I tried the binary search on the 2D matrix and I got the solution which gives the time compexity to be the O(logN.logM). There exist already a solution which performs it in log(MN) time. I Only want to know which is better or less-time taking. Really a burning question.
Upvotes: 1
Views: 1845
Answers (1)
Dakrin
Reputation: 39
Well the question is some what ambigous. If you want to ask if O(logM+logN) > O(logM*logN) then the answer is no, O(logM+logN) is always less than O(logM*logN).
In the body of the question you say that your complexity is O(logN*logM) and the complexity of a known algorithm is O(log(MN)). Since O(log(MN)) = O(log(M)+log(N)) we can say that O(log(M)*log(N)) > O(log(MN))
Upvotes: 3
Related Questions
- Difference between O(n) and O(log(n)) - which is better and what exactly is O(log(n))?
- O(n log m) vs O(n+m) - which is better?
- O(n log n) vs O(m) for algorithm
- Comparing one implementation with two methods having O(1), O(n) complexity with another having O(log n) for both of them, which is better?
- Time Complexity log(n) vs Big O (root n)
- Is Time complexity O(N) or O(Log N)?
- Which is better: O(nm) or O(n log n)?
- What is better BigO log(m*n) or (m+n)?
- O(n^2) vs O (n(logn)^2)
- big O complexity O(n log n) vs O(n log m)