Computer Science, asked by jast85421, 1 year ago

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

Answers

Answered by sushmita

4

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.

Answered by RAHULsharma56

1

1) constant time

2) quadrant time

3)linear time

4) arithmetic time

Previous Question

Next Question

Similar questions

English, 7 months ago

suppose one day you went with your brother to a countryside where you suddenly saw a rainbow after a little shower of rain. Write in your own words how you enjoyed the moment in five complet sentences. Also draw a picture of the rainbow and the landscape that you experienced ...

English, 7 months ago

half the class is making bets (add question tag)...

History, 7 months ago

Conflicts must be resolved according to A The Laws Of The Land B The View Of The Majority C The Rich People D None Of These ...

Biology, 1 year ago

Mention the mode of reproduction used by amoeba hydra spirogyra...

Computer Science, 1 year ago

Convert 1 gb into KB?

English, 1 year ago

request letter for new blazer...

Business Studies, 1 year ago

Role of advertising standard council of india...

Accountancy, 1 year ago

Reforms in direct and indirect taxes in india...