Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Calculate the time complexity of each algorithm listed below: algorithm - 1 int sum() { sum=0; for(int i=0; i <10; i++) { sum = sum+1;

Calculate the time complexity of each algorithm listed below:

algorithm - 1

int sum()

{

sum=0;

for(int i=0; i<10; i++)

{

sum = sum+1;

}

return sum;

}

algorithm - 2

int sum(int m)

{

sum=0;

for(int i=0; i

{

sum = sum+1;

}

return sum;

}

algorithm - 3

int sum(int m)

{

sum=0;

for(int i=0; i

{

for(int j=0; j<10; j++)

sum = sum+1;

}

return sum;

}

algorithm - 4

int sum(int m)

{

sum=0;

for(int i=0; i

{

for(int j=0; j

sum = sum+1;

}

return sum;

}

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Harness The Power Of Big Data The IBM Big Data Platform

Authors: Paul Zikopoulos, David Corrigan James Giles Thomas Deutsch Krishnan Parasuraman Dirk DeRoos Paul Zikopoulos

1st Edition

0071808183, 9780071808187

More Books

Students also viewed these Databases questions