Find the space complexity of the following code segment. m=5; int findSum(...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Find the space complexity of the following code segment.
m=5;
int findSum(int a[],int b[], int n)
{
sum=m;
for(i=1; i<=n; i++)
sum=b[i]+a[i];
return sum
}
❌
❌
✅
❌
Want instant access to all verified answers on moovit.vit.ac.in?
Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!