Question

How do you find the time complexity of a given algorithm?

Answer 1

Introduction. In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the string representing the input.

Big O notation. ...

O(1) Constant Time: ...

O(n) Linear Time. ...

O(log n) Logarithmic Time: ...

O(n2) Quadratic Time. ...

Some Useful links.

Answer 2

1) constant time

2) quadrant time

3)linear time

4) arithmetic time