Question

An algorithm which executes on constant time period can be denoted as select one:

a. O(n2)

b. O(n)

c. O(1)

d. O(nlogn)

Answer 1

Answer:

O(1)

Explanation:

Answer 2

An algorithm which executes on ‘constant time period’ can be denoted as O(1).

Option: (c)

Explanation:

• The algorithmic complexity defines how slow or how fast the algorithm going to perform. The complexity can be defined as a numerical function T(n) i.e. time verses input size n.  

• Here, the time taken can be defined without being based on the implementation details. Here the constant time period, the algorithm going to execute is O(1).  

• An algorithm can be defined to be run in constant time, if it requires same time regardless of size of the input.