Algorithms | Analysis of Algorithms | Question 18

Last Updated :
Discuss
Comments

Consider the following function,

 int unknown(int n) {
    int i, j, k = 0;
    for (i  = n/2; i <= n; i++)
        for (j = 2; j <= n; j = j * 2)
            k = k + n/2;
    return k;
 }

What is the time complexity of the function? (GATE CS 2013)

n^2

n logn

n^3

n^3 logn 

This question is part of this quiz :

Top MCQs on Complexity Analysis of Algorithms with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy