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 429865
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 12, 20262026-05-12T19:49:04+00:00 2026-05-12T19:49:04+00:00

a) for(int i = 100000; i > 0; i–) {} b) for(int i =

  • 0

a) for(int i = 100000; i > 0; i--) {}

b) for(int i = 1; i < 100001; i++) {}

The answer is there on this website (question 3). I just can’t figure out why? From website:

3. a

  • 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-12T19:49:04+00:00Added an answer on May 12, 2026 at 7:49 pm

    When you get down to the lowest level (machine code but I’ll use assembly since it maps one-to-one mostly), the difference between an empty loop decrementing to 0 and one incrementing to 50 (for example) is often along the lines of:

          ld  a,50                ld  a,0
    loop: dec a             loop: inc a
          jnz loop                cmp a,50
                                  jnz loop
    

    That’s because the zero flag in most sane CPUs is set by the decrement instruction when you reach zero. The same can’t usually be said for the increment instruction when it reaches 50 (since there’s nothing special about that value, unlike zero). So you need to compare the register with 50 to set the zero flag.


    However, asking which of the two loops:

    for(int i = 100000; i > 0; i--) {}
    for(int i = 1; i < 100001; i++) {}
    

    is faster (in pretty much any environment, Java or otherwise) is useless since neither of them does anything useful. The fastest version of both those loops no loop at all. I challenge anyone to come up with a faster version than that 🙂

    They’ll only become useful when you start doing some useful work inside the braces and, at that point, the work will dictate which order you should use.

    For example if you need to count from 1 to 100,000, you should use the second loop. That’s because the advantage of counting down (if any) is likely to be swamped by the fact that you have to evaluate 100000-i inside the loop every time you need to use it. In assembly terms, that would be the difference between:

         ld  b,100000             dsw a
         sub b,a
         dsw b
    

    (dsw is, of course, the infamous do something with assembler mnemonic).

    Since you’ll only be taking the hit for an incrementing loop once per iteration, and you’ll be taking the hit for the subtraction at least once per iteration (assuming you’ll be using i, otherwise there’s little need for the loop at all), you should just go with the more natural version.

    If you need to count up, count up. If you need to count down, count down.

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

Sidebar

Related Questions

void (int a[]) { a[5] = 3; // this is wrong? } Can I
int x = n / 3; // <-- make this faster // for instance
int x; printf(hello %n World\n, &x); printf(%d\n, x);
int[] mylist = { 2, 4, 5 }; IEnumerable<int> list1 = mylist; list1.ToList().Add(1); //
int n = 5; for(int i = 0;i!=n;i++)//condition != { //executing 5times } int
int main(void) { char tmp, arr[100]; int i, k; printf(Enter a string: ); scanf_s(%s,
getEmployeeNameByBatchId(int batchID) getEmployeeNameBySSN(Object SSN) getEmployeeNameByEmailId(String emailID) getEmployeeNameBySalaryAccount(SalaryAccount salaryAccount) or getEmployeeName(int typeOfIdentifier, byte[] identifier) ->
Consider: int testfunc1 (const int a) { return a; } int testfunc2 (int const
inline int factorial(int n) { if(!n) return 1; else return n*factorial(n-1); } As I
typeof(int).Name Will return System.Int32 does anyone know of a way to return int

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.