What is the time complexity of the following piece of

Info icon This is a preview. Sign up to view the full content.

18. What is the time-complexity of the following piece of code in “Big-Oh” notation? sum = 0; for (int i = 0; i < n; i++) for (j = 1; j < n; j = j*2) sum += n;
Image of page 3
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.
  • Fall '16
  • H.P.
  • Tree traversal, logx b

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern