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

Other tools

Ask the community(1)
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; }
Post
0 AIs selected
Clear selection
#
Name
Task