Question

Write a recursive fucntion aNbN that takes an integer and returns the Stringaa...abb...b for example:

aNbN (0) returns

aNbN (1) returns ab

aNbN (3) returns aaabbb

Updated 35 mins ago:

using format

#include <iostream>

#include <string>

using namespace std;

Answer 1

#include <iostream>
#include <string>

using namespace std;

string aNbN(int n) {
    if (n == 0) {
        return "";
    } else {
        string s = "a";
        s += aNbN(n - 1);
        s += "b";
        return s;
    }
}

int main() {
    cout << "\"" << aNbN(0) << "\"" << endl;
    cout << "\"" << aNbN(1) << "\"" << endl;
    cout << "\"" << aNbN(3) << "\"" << endl;
    return 0;
}