5. [15 points] Consider the following procedure: void george (int n) { } int m =...

 

Transcribed Image Text:

5. [15 points] Consider the following procedure: void george (int n) { } int m = n; while (m1) { } for (int i=1; i < m; i++) cout < < "I cannot tell a lie.. I chopped down the cherry tree." < < endl; m = m/2; Consider the question of how many lines of output the execution of george (n) would produce. Write down an appropriate recurrence for this question, and give an asymptotic solution in terms of n, using either O, 2, or e, whichever is most appropriate. 5. [15 points] Consider the following procedure: void george (int n) { } int m = n; while (m1) { } for (int i=1; i < m; i++) cout < < "I cannot tell a lie.. I chopped down the cherry tree." < < endl; m = m/2; Consider the question of how many lines of output the execution of george (n) would produce. Write down an appropriate recurrence for this question, and give an asymptotic solution in terms of n, using either O, 2, or e, whichever is most appropriate.

Answer rating: 100% (QA)

To analyze the number of lines of output produced by the execution of the georgen function lets brea... View the full answer