The function that draws c-curves, and which was discussed in Chapter 7, has two recursive calls. Here is the code:
You can assume that the function drawLine runs in constant time. State the computational complexity of the cCurve function, in terms of the level, using big-O notation. Also, draw a call tree for a call of this function with a level of 3.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here