Top Questions

1. For an algorithm with a time complexity of O(N+M), if M is always less than N, can we say the time complexity will be O(N)?
   0 votes

   1 answers