During the assignment, I was asked to describe the time complexity of my algorithm, and as I was writing, I suddenly had a question.
I know that we can usually ignore the coefficients before n and m in the time complexity calculation, but in the case of O(2n+4m), each coefficient is different, can we ignore them equally and still be bounded by O(n+m)?
It’s kind of a stupid question, but I don’t think I have the right concept…sorry
New contributor
제저씨 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.