What is the most reasonable recurrence for the following operation? int f (A, key, n) {...

Transcribed Image Text:

What is the most reasonable recurrence for the following operation? int f (A, key, n) { if (n <1) return false; if (A[n] key) return true; return f (A, n-2, key); What is the most reasonable recurrence for the following operation? int f (A, key, n) { if (n <1) return false; if (A[n] key) return true; return f (A, n-2, key);