C / C++ / MFC

Richard Deeming wrote:

But if it's a homework assignment to teach the student about recursion, as jschell suggested...

kalberts wrote:

it is a very poor choice

trønderen wrote:

and create homework assignments, with problems suited for recursion.

trønderen wrote:

So if that is the case here, the teacher should be blamed. Especially if the assignment is as suggested in the subject line,

trønderen wrote:

A lot of problems can be described in a very concise form in recursive terms, but can easily be implemented as an iteration (and most students will not discover that and make a recursive implementation ... I speak of experience). Here is no trace of a recursive problem description.

jschell wrote:

with my 40 years of development experience and numerous cases of recursion unrolling not to mention more than 30 years of formal designs and 20 of architecture

jschell wrote:

I wonder who the idiot was ...

Quote:

A pointer to a variable that specifies the size of the buffer pointed to by the lpData parameter, in bytes. When the function returns, this variable contains the size of the data copied to lpData.

The lpcbData parameter can be NULL only if lpData is NULL.

If the data has the REG_SZ, REG_MULTI_SZ or REG_EXPAND_SZ type, this size includes any terminating null character or characters unless the data was stored without them. For more information, see Remarks.

---> If the buffer specified by lpData parameter is not large enough to hold the data, the function returns ERROR_MORE_DATA and stores the required buffer size in the variable pointed to by lpcbData. In this case, the contents of the lpData buffer are undefined. <---

If lpData is NULL, and lpcbData is non-NULL, the function returns ERROR_SUCCESS and stores the size of the data, in bytes, in the variable pointed to by lpcbData. This enables an application to determine the best way to allocate a buffer for the value's data.

If hKey specifies HKEY_PERFORMANCE_DATA and the lpData buffer is not large enough to contain all of the returned data, RegQueryValueEx returns ERROR_MORE_DATA and the value returned through the lpcbData parameter is undefined. This is because the size of the performance data can change from one call to the next. In this case, you must increase the buffer size and call RegQueryValueEx again passing the updated buffer size in the lpcbData parameter. Repeat this until the function succeeds. You need to maintain a separate variable to keep track of the buffer size, because the value returned by lpcbData is unpredictable.

If the lpValueName registry value does not exist, RegQueryValueEx returns ERROR_FILE_NOT_FOUND and the value returned through the lpcbData parameter is undefined.

puckettrobinson675 wrote:

is there a way to add a repeating number to an integer to infinity?
Example...the integer is 10 and I want to add 4 to it. Then 4 again. And again. And again in a loop

int number = 10;
std::vector vec = { 1, 2, 3 };
for (int value : vec)
{
    std::cout << number + value << std::endl;
}

Quote:

Is there a way to add all the elements of a vector to an integer sequentially?

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;


void dump (vector<int> v)
{
  for (auto x :v )
    cout << x << " ";
  cout << "\n";
}

int main()
{

  { // method 1: access items by indices
    vector<int> v{1,2,3};

    int c = 4;

    for (size_t n = 0; n<v.size(); ++n)
    {
      v[n] += c;
    }

    cout << "method 1: ";
    dump(v);
  }

  { // method 2: access items with ranged for loop
    vector<int> v{1,2,3};

    int c = 4;

    for (auto & x : v)
    {
      x += c;
    }

    cout << "method 2: ";
    dump(v);
  }


  { // method 3: use 'transform' of the algorithm library
    vector<int> v{1,2,3};

    int c = 4;

    transform(v.begin(), v.end(), v.begin(), [=](int  x){ return x+c; });

    cout << "method 3: ";
    dump(v);
  }
}

Quote:

As a side note, is there a way to add a repeating number to an integer to infinity?

#include <iostream>
using namespace std;


int main()
{
  int i = 1;
  int last_i;
  int c = 4;
  for (;;)
  {
    last_i = i;
    i += c;
    if ( i < last_i)
      break;
  }

  cout <<  "unfortunately, (" << last_i << "+" << c << ") makes " <<  i;
}