Given the following user-defined function, february. Assume that an implemented user-defined function called loo (which returns...

Transcribed Image Text:

Given the following user-defined function, february. Assume that an implemented user-defined function called loo (which returns some integer value) has a running time of O(n). int february(int n, int m, int p) { } if(n < p 1 m <p) return 1; else if(m<n) return 1+ loo() february (n 1, m, p); else return 3+ loo() + february(n-1, m, p); - How would you express the recurrence relation? You do not need to solve this one! None of these choices T(n) c1+2n+2T(n-1) T(n)-c1+2n + T(n-1) T(n)-1+2n+2T(n-1) T(n)=c1-2n+2T(n-1) T(n)=c1+n-2T(n-1) T(n)=c1+n+2T(n-1) Given the following user-defined function, february. Assume that an implemented user-defined function called loo (which returns some integer value) has a running time of O(n). int february(int n, int m, int p) { } if(n < p 1 m <p) return 1; else if(m<n) return 1+ loo() february (n 1, m, p); else return 3+ loo() + february(n-1, m, p); - How would you express the recurrence relation? You do not need to solve this one! None of these choices T(n) c1+2n+2T(n-1) T(n)-c1+2n + T(n-1) T(n)-1+2n+2T(n-1) T(n)=c1-2n+2T(n-1) T(n)=c1+n-2T(n-1) T(n)=c1+n+2T(n-1)

Answer rating: 100% (QA)

This photo contains a userdefined function called february written in C programming language and a question that asks to express the recurrence relati... View the full answer