top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

What is the difference between O(1) and O(5) in terms of algorithm complexity?

0 votes
331 views
What is the difference between O(1) and O(5) in terms of algorithm complexity?
posted Feb 20, 2017 by anonymous

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer

+1 vote

O(1) and O(5) both represent same time complexity since both the dictating constant time no matter on size of problem. This is also constant time complexity.

answer Feb 20, 2017 by Harshita
Similar Questions
...