adplus-dvertising
frame-decoration

Question

What is the time complexity of following code: 
int i, j, k = 0;
for (i = n / 2; i <= n; i++) 
{
for (j = 2; j <= n; j = j * 2) 
{
k = k + n / 2;
}
}

a.

O(n)

b.

O(nLogn)

c.

O(n²)

d.

O(n²Logn)

Posted under Algorithm Complexity Data Structures and Algorithms

Answer: (b).O(nLogn)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the time complexity of following code:
Add Comment

Similar Questions

Discover Related MCQs

Q. The worst case occur in quick sort when

View solution

Q. What does it mean when we say that an algorithm X is asymptotically more efficient than Y?

View solution

Q. The complexity of Fibonacci series is

View solution

Q. The worst case complexity for insertion sort is

View solution

Q. The worst case complexity of quick sort is

View solution

Q. To measure Time complexity of an algorithm Big O notation is used which:

View solution

Q. If for an algorithm time complexity is given by O(1) then complexity of it is:

View solution

Q. If for an algorithm time complexity is given by O(log2n) then complexity will:

View solution

Q. If for an algorithm time complexity is given by O(n) then complexity of it is:

View solution

Q. If for an algorithm time complexity is given by O(n²) then complexity will:

View solution

Q. If for an algorithm time complexity is given by O((3/2)ⁿ) then complexity will:

View solution

Q. The time complexity of binary search is given by:

View solution

Q. The time complexity of linear search is given by:

View solution

Q. Time complexity of binary search algorithm is constant.

View solution

Q. Which is the best data structure for round robin algorithm for CPU scheduling?

View solution

Q. Which algorithm is having highest space complexity?

View solution

Q. If the array is already sorted, then the running time for merge sort is:

View solution
View All MCQs on Algorithm Complexity

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

DBMS

Get a firm grasp on database systems with our DBMS MCQs. Explore relational...

Microprocessor

Understand the heart of your computer with our Microprocessor MCQs. Topics include...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...