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

  • Home
  • SEARCH
  • 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 7540865
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 30, 20262026-05-30T07:44:40+00:00 2026-05-30T07:44:40+00:00

What would be the runtime complexity of this piece of code. The code works

  • 0

What would be the runtime complexity of this piece of code. The code works as it is supposed to work, I am just a little confused about the runtime complexity.

int Something(int x[]){
int i=0;
for(i=0;i<x.length;i++){
    //some code over here
    i=-1;
}

Please be aware this is not an infinite loop since there is a continue and break statement in the loop. However it does loop quite a few times because of the condition i = -1 at the end of the loop.

O(n) complexity means that there are no nested loops and this code has no nested loops. But I don’t really think this will be O(n). It also won’t be O(n^2) or anything like that since there aren’t any nested loops.

  • 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-05-30T07:44:41+00:00Added an answer on May 30, 2026 at 7:44 am

    In it’s current form this is O(infinity). It might never stop.

    If there is a break statement in the loop you have to provide the full code. Without that, analysis is not possible.

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

Sidebar

Related Questions

I would like to step through Ruby code at runtime, but it seems difficult
How would one go about loading compiled C code at run time, and then
I didn't get the answer to this anywhere. What is the runtime complexity of
I would like to use Runtime.exec() to initiate another process in a directory with
I would like to retrieve at runtime the values for the dialect and connection.driver_class
I would like to avoid redistributing .NET runtime if possible with my application since
I would like to create simple objects at runtime (textbox, label, etc) and add
I would like to display static (shared) objects at runtime in a PropertyGrid but
I would like to have a QMainWindow that can change it's look at runtime,
I would like to be able to know, in run-time in my code, how

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.