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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T04:36:43+00:00 2026-05-27T04:36:43+00:00

I know that if the integer is dissected rather than being computed as a

  • 0

I know that if the integer is dissected rather than being computed as a whole, the total of individual bytes will yield incorrect result. However, for curiosity, I want to examine individual byte and make.I’m not sure if this is correct to inspect each byte in an integer pointer:

#include <iostream>
int main(int argc, char *argv[])
{
    using namespace std;

    int *num = new int;
    *num = 123456789;
    cout << "Num: " << *num << '\n';
    char* numchar_ptr = reinterpret_cast<char*> (num);
    for (int i = 0; i < 4; ++i)
    {
        cout << "number char: " << i << ' ' << (short) *(numchar_ptr+i) << '\n';
        *(numchar_ptr+i) = i
    }
    cout << "New num: " << *num << '\n';
    delete num;

    return 0;
}

According to the loop, the bytes in the integer will be: 0 1 2 3
which is equal to 00000000 00000001 00000010 00000011 in binary and 66051 in decimal
But I got the result “New num” is 50462976. Why?

  • 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-27T04:36:43+00:00Added an answer on May 27, 2026 at 4:36 am

    You need to take endianness into account. On your system, numbers are stored in little-endian representation, which means that the lowest-addressed byte is the least-significant.

    Therefore, your number is:

      0 * (1 << 0)
    + 1 * (1 << 8)
    + 2 * (1 << 16)
    + 3 * (1 << 24)
    

    which is 50462976.

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

Sidebar

Related Questions

I know that for an integer, you can use: int value; I tried: string
I know that |DataDirectory| will resolve to App_Data in an ASP.NET application but is
We know that id of any table is of integer type and auto-increment in
I know that sometimes if you don't initialize an int , you will get
I know that the first route will catch most of the paths. However, this
I know that Google Chrome uses an integer timestamp, properly called the Webkit timestamp,
I know in Java that int is a 32 bit integer and that long
I know that I can set up an integer before the loop and increment
I want to display an integer that the user will define in the XML.
Does anyone know of a class/library/etc. that can simulate 32 bit unsigned integers on

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.