Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8624103
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 12, 20262026-06-12T07:26:33+00:00 2026-06-12T07:26:33+00:00

for(int i = 1 ; i < n ; i* = 2) for(int j

  • 0
for(int i = 1 ; i < n ; i* = 2)
for(int j = 1 ; j < i ; j* = 2)

Can anyone explain me this?
I think it is log(n)*log(i) .Is that correct?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-12T07:26:34+00:00Added an answer on June 12, 2026 at 7:26 am

    Assuming

    for (i = 1; i < n; i *= 2)
       for (j = 1; j < i; j *= 2)
          ...stuff...
    

    “stuff” will be run 1 + 2 + 3 + … + log(n)-1 times. Since the sum of integers 1 to N is N * (N + 1) / 2, worse case run time is O(log(n) ^ 2).

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Can anyone explain this OCaml toplevel behaviour? # 1________________________________1;; - : int = 11
Can anyone please explain this? struct node { int data; struct node * link;
Can anyone help with this... vector<unsigned int> *vVec = new vector<unsigned int>; vVec .reserve(frankReservedSpace);
This is the error occurs in logcat,can anyone tell what's the meaning? private int
I've got some numbers that is now larger than INT can handle. This is
Can anyone explain to me why this code below does not work? #include opencv/cv.h
Can anyone explain this strange behavior found when trying to use sapply and which.min
Can anyone explain to me what is going on here? First off, I think
Is there anyone able to explain me this strange behavior? int i = 0x1234;
Can anyone explain this one to me. I'm trying to set the sizes of

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.