<div>
You have to simulate the function processing by hand.<br />
<br />
How many times do you execute the loop if n=8, 16, ... for example?
</div>


You have to simulate the function processing by hand.

How many times do you execute the loop if n=8, 16, ... for example?

<div>
<div class="content wysiwyg-content">
The following question is one of the questions from an in-class homework assignment page that I don't believe we ever went over:<br />
<br />
What is the running time complexity of the given function? <br />

<pre><code id="code-10-26989172-1"> 
          int mystry(int n) {
                if  ( n == 0 ) return 0 ;
                return 1+ mystry(n/2) ;
          }</code></pre>
<br />
Could you please also give me a quick explanation of how this type of proplem is solved?
</div>
</div>


The following question is one of the questions from an in-class homework assignment page that I don't believe we ever went over:

What is the running time complexity of the given function? 
(CODE)

Could you please also give me a quick explanation of how this type of proplem is solved?

What is the running time complexity of the given function?

An algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.

Algorithms

Programming theory deals with the design, implementation, analysis, characterization, and classification of programming languages and their individual features, along with introductory programming concepts like program structure, variable declaration and conditional and looping constructs. Sub-disciplines include the formal semantics of programming languages, type theory, program analysis and transformation, comparative programming language analysis, metaprogramming, domain-specific languages, compiler construction and run-time systems.

Programming Theory

Java is a platform-independent, object-oriented programming language and run-time environment, designed to have as few implementation dependencies as possible such that developers can write one set of code across all platforms using libraries. Most devices will not run Java natively, and require a run-time component to be installed in order to execute a Java program.