10.9. Vector of random numbers

The first step is to generate a large number of random values and store them in a vector. By “large number,” of course, I mean 20. It’s always a good idea to start with a manageable number, to help with debugging, and then increase it later.

The following function takes a single argument, the size of the vector. It allocates a new vector of ints, and fills it with random values between 0 and upperBound-1.

vector<int> randomVector (int n, int upperBound) {
  vector<int> vec (n);
  for (size_t i = 0; i < vec.size(); i++) {
    vec[i] = random () % upperBound;
  }
  return vec;
}

The return type is vector<int>, which means that this function returns a vector of integers. To test this function, it is convenient to have a function that outputs the contents of a vector.

void printVector (const vector<int>& vec) {
  for (size_t i = 0; i < vec.size(); i++) {
    cout << vec[i] << " ";
  }
}

Notice that it is legal to pass vectors by reference. In fact it is quite common, since it makes it unnecessary to copy the vector. Since printVector does not modify the vector, we declare the parameter const.

The following code generates a vector and outputs it:

int numValues = 20;
int upperBound = 10;
vector<int> vector = randomVector (numValues, upperBound);
printVector (vector);

On my machine the output is

3 6 7 5 3 5 6 2 9 1 2 7 0 9 3 6 0 6 2 6

which is pretty random-looking. Your results might be different.

Try running the active code below!

#include <iostream> #include <vector> using namespace std; vector<int> randomVector (int n, int upperBound); void printVector (const vector<int> & vec); int main() { int numValues = 20; int upperBound = 10; vector<int> vector = randomVector (numValues, upperBound); printVector (vector); } ==== vector<int> randomVector (int n, int upperBound) { vector<int> vec (n); for (size_t i = 0; i<vec.size(); i++) { vec[i] = random () % upperBound; } return vec; } void printVector (const vector<int>& vec) { for (size_t i = 0; i<vec.size(); i++) { cout << vec[i] << " "; } }

If these numbers are really random, we expect each digit to appear the same number of times—twice each. In fact, the number 6 appears five times, and the numbers 4 and 8 never appear at all.

Do these results mean the values are not really uniform? It’s hard to tell. With so few values, the chances are slim that we would get exactly what we expect. But as the number of values increases, the outcome should be more predictable.

To test this theory, we’ll write some programs that count the number of times each value appears, and then see what happens when we increase numValues.

Q-2: How should we declare the parameter, vector, if we don’t intend to make any changes to it?

Q-3: As we store more and more random numbers in a vector, we expect its contents to be __________.

• more uniform
• Correct!
• less uniform
• Incorrect! As we store more random numbers in a vector, we see that the frequencies of each number are approximately equal.
• more normal
• Incorrect! The distribution of random numbers is not related to the normal distribution.
• less normal
• Incorrect! The distribution of random numbers is not related to the normal distribution.

Q-4: Would compiling the following code lead to a compiler error?

void dostuff (const vector<int> & vec) {
   for (size_t i = 0; i < vec.size(); i++) {
      vec[i] = vec[i] ;
   }
}

• yes we would get a compile error
• Correct! we can't make changes to a vector we take in by constant reference
• no we would not because values remain same.
• Even if we keep the values same we are editing a constant which is not allowed.

You have attempted of activities on this page