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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 22, 20262026-05-22T21:02:08+00:00 2026-05-22T21:02:08+00:00

int i, nhashprime = nextprime(2 * hashprime) ; Does this line equal int i,

  • 0
int i, nhashprime = nextprime(2 * hashprime) ;

Does this line equal

int i, nhashprime;
i = nextprime(2 * hashprime);
nhashprime = i;

or does it do something else?

  • 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-22T21:02:09+00:00Added an answer on May 22, 2026 at 9:02 pm

    This initializes nhashprime and not i. The int part applies to both i and nhashprime, but the assignment only applies to nhashprime. The code is equivalent to

    int i;
    int nhashprime = nextprime(2 * hashprime);
    

    It’s generally not a good idea to combine multiple declarations into one, except in the simple case with simple types and no initialization:

    int i, j, k;
    

    Note in particular that pointer markers do not distribute to multiple identifiers either:

    int *p, i;
    

    should be avoided and is equivalent to

    int *p;
    int i;
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

int main() { const int maxint=100;//The program will crash if this line is put
int x = n / 3; // <-- make this faster // for instance
int Size(struct node* node) { if(node == NULL) { return 0; } else if(node
int* p = 0; int* q = &*p; Is this undefined behavior or not?
int m=32 printf(%x , ~m); Output of this statement is ffdf and without ~
int main() { int i; if (cin >> i) { //ok } else {
int foo (int a , int b = 0) I just read this code.
int startingPoint[2]={i,j}; I got this after reading an online code.Is this correct? Means if
int* func() { int* i=new int[1]; //do something return i; } void funcc() {
int main() { int i=3; (++i)++; printf(%d,i); } This programs works with g++ compiler

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.