What is the time complexity of the following iterative method used to find the sum of the first n natural numbers?
#include<stdio.h>
int get_sum(int n)
{
int sm, i;
for(i = 1; i <= n; i++)
sm += i;
return sm;
}
int main()
{
int n = 10;
int ans = get_sum(n);
printf("%d",ans);
return 0;
}
#include<stdio.h>
int get_sum(int n)
{
int sm, i;
for(i = 1; i <= n; i++)
sm += i;
return sm;
}
int main()
{
int n = 10;
int ans = get_sum(n);
printf("%d",ans);
return 0;
}A. O(1)
B. O(n)
C. O(n2)
D. O(n3)
Answer: Option B
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Join The Discussion