将二进制向量转换为十进制数组

Question

I've created a method to generate random binary numbers with n-digits up to 256 digits. In order to continue with my program I need to take the vector with my binary value and put it into a decimal array and then convert that number into a int decimal. Here's the following function that creates the random binary vector and my attempt to convert to decimal. I'm having trouble converting my binary vector to a decimal.

int random_binary(int n, int m){

   vector<int> binary;

   for(int i = 0; i < n; i++)
   {
      m = rand() % 2;

      binary.push_back(m);
   }

   binary.push_back(1);

   int j;

   for(j = 0; j < binary.size(); j++)
   {
       cout << binary[j];
   }
   cout <<"\n";


   int len = binary.size();
   int a = binary[len];   //having trouble right here

   int decimalValue = 0;

   for (int i = len-1; i>= 0; i--)
   {
       decimalValue = decimalValue + binary[i]*pow(2,len-i-1);
   }

   return decimalValue;
}

If anybody could help figure this out that would be much appreciated.

Answer 1

The code isn't all that bad, but it does have a few problems:

• An int value can only hold 32 bits on most platforms, 31 bits if you only want non-negative values. So for 256 binary digits, you will need to use something else.

• int a = binary[len]; //having trouble right here int a = binary[len]; //having trouble right here - I think @PaulMcKenzie interprets this as an attempt to declare an array of int with a variable number of elements ( int a[len]; ). I see it as probably initializing an int variable to the element in binary one past the last entry. Either way is wrong -- but you never use a anyway, and I don't see any possible use for it. So just delete that line.

• Not a bug, but you should understand that int decimalValue isn't decimal, it is an integer, which is most likely stored inside the computer as a set of bits, and only appears as a decimal number when converted and displayed a certain way, like when printed using std::cout .

• In the sum loop, std::pow should not be used for integer values, but luckily the bit left shift operator can be used to get integer powers of 2:
  decimalValue = decimalValue + binary[i] * (1<<(len-i-1));