C++ Algorithms:

Find the runtime function as a function n. Remember f count each operative statement (of course comments don't count).

Also write the order ("Big O"). Show work.

------------------------

#include using namespace std;

int sum = 0, k = 1;

int add(int n) { sum = sum + k;

k++;

if (k - 1 == n) return sum;

else return add(n); ; }

int main() { int x = 0;

cout << "enter num" << endl; cin >> x; cout << add(x) << endl; system("pause"); return 0; }

-----------------------------

I would appreciate an explanation to help understand this concept to practice more on my own please