xyz Interview Question for xyzs


Country: United States




Comment hidden because of low score. Click to expand.
2
of 2 vote

You can find out the time complexity of above algorithm by solving following equation :
T(n) = T(n-1) + T(n-1) + const.

You are likely to get T(n) = O(2^n).

- Rajeev Jayaswal February 24, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.
1
of 1 vote

Well, one way to analyze it would be to set up the recurrence equation that reflects the number of recursive calls the algorithm makes: T(1) = O(1) and T(n) = 2*T(n-1) for n>1.

An easy induction shows T(n) = 2^{n-1}, so the algorithm makes O(2^n) recursive calls, which is also its running time as it takes O(1) time within each call.

- blazs February 24, 2015 | Flag Reply
Comment hidden because of low score. Click to expand.


Add a Comment
Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More

Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More