How to find time complexity of a program

In above example, we have fixed part and moving part. You need to understand fix part is basically constant space i. Moving part is quite different, they are usually dependent of input size in our case its n. When an operation is repeated n times that means all the operations that falls under this statement they also repeated n times. In our case a for loop repeats n times therefore variable z which has 1 unit of space is repeated n times.

Dhawal Arora. Easy Normal Medium Hard Expert. Writing code in comment? Please use ide. Load Comments. What's New. Most popular in Analysis.

More related articles in Analysis. We use cookies to ensure you have the best browsing experience on our website. Start Your Coding Journey Now! Anonymous August 22, at AM. Anonymous October 30, at AM. Unknown December 23, at AM. Cracking the coding interview March 16, at PM. Unknown April 27, at PM. Ehsan Lodhi November 21, at PM. Newer Post Older Post Home. Subscribe to: Post Comments Atom.

Social Icons. Post your articles If you would like to contribute some articles on computer science related subjects or programming, mail them to solutiomagister gmail. See your article appearing on Btechonline. You can also contribute practice questions with answers and explanations on GATE. NB:- Content copied from other websites,blogs or books will not be accepted.

If you cannot avoid them in your explanation please provide the reference. For simplicity assume that array is always dividing into half. If not even half, it will process first part m. Stack Overflow for Teams — Collaborate and share knowledge with a private group. Create a free Team What is Teams? Collectives on Stack Overflow. Learn more. Ask Question. Asked 3 years, 1 month ago.