How can I find the time complexity of an algorithm?
I have gone through Google and Stack Overflow search, but nowhere I was able to find a clear and straightforward explanation for how to calculate time complexity.
What is the time complexity of a function f(n) that is O(g(n)) where “part” of g(n) is o(h(n))?
Let’s say I have a function f(n) that is O(ELgV) and I know that E is o((V^2)/LgV), what would the overall time complexity of f(n) be in terms of little o (is this even a meaningful question)?