Q83
MCQ2 marks, −0.5The time complexity of the following C function is (assume ) int recursive (int n) { if(n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); }
Sign in to save attempts.
Loading…
The time complexity of the following C function is (assume ) int recursive (int n) { if(n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); }
Loading…