TAAFT
Free mode
100% free
Freemium
Free Trial
Deals
Create tool

ASHUTOSH MISHRA 21SCSE1010696

@ashutoshmishra2 Tasks: 3
Beginner
Joined: February 2025

Comments

ASHUTOSH MISHRA 21SCSE1010696
time complexity of this code? int res(int arr[], int i, int n, int k){ if(n-i>0){ if(sum(arr, i, n)==k){ return n-i; } else{ return max(res(arr,i 1,n,k),res(arr,i,n-1,k)); } } else return -1; }
0 AIs selected
Clear selection
#
Name
Task