Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- a = number of recursive calls
- b = hello (n-23) pues b es 23
- k = complejidad del resto de instrucciones n= n^k 3 loops -> k es 3
- si por ejemplo es int a = 10 que es complejodad O of 1, la k es 0
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement