Karatsuba Algorithm for fast Multiplication of Large Decimal Numbers represented as Strings

  #include using namespace std;  string findSum(string str1, string str2){            if (str1.length() > str2.length())        swap(str1, str2);          string str = “”;          int n1 = str1.length();    int n2 = str2.length();          reverse(str1.begin(), str1.end());    reverse(str2.begin(), str2.end());      int carry = 0;    for (int i = 0; i < n1; i++) {                          int sum            = ((str1[i] - '0')               + (str2[i] - '0')               + carry);        str.push_back(sum % 10 + '0');                  carry = sum / 10;    }          for (int i = n1; i < n2; i++) {        int sum = ((str2[i] - '0') + carry);        str.push_back(sum % 10 + '0');        carry = sum / 10;    }          if (carry)        str.push_back(carry + '0');          reverse(str.begin(), str.end());      return str;}  string findDiff(string str1, string str2){        string str = "";          int n1 = str1.length(), n2 = str2.length();          reverse(str1.begin(), str1.end());    reverse(str2.begin(), str2.end());      int carry = 0;              for (int i = 0; i < n2; i++) {                          int sub            = ((str1[i] - '0')               - (str2[i] - '0')               - carry);                          if (sub < 0) {            sub = sub + 10;            carry = 1;        }        else            carry = 0;          str.push_back(sub + '0');    }              for (int i = n2; i < n1; i++) {        int sub = ((str1[i] - '0') - carry);                          if (sub < 0) {            sub = sub + 10;            carry = 1;        }        else            carry = 0;          str.push_back(sub + '0');    }          reverse(str.begin(), str.end());          return str;}  string removeLeadingZeros(string str){            const regex pattern("^0+(?!$)");              str = regex_replace(str, pattern, "");    return str;}  string multiply(string A, string B){    if (A.length() > B.length())        swap(A, B);              int n1 = A.length(), n2 = B.length();    while (n2 > n1) {        A = “0” + A;        n1++;    }          if (n1 == 1) {                          int ans = stoi(A) * stoi(B);        return to_string(ans);    }              if (n1 % 2 == 1) {        n1++;        A = “0” + A;        B = “0” + B;    }      string Al, Ar, Bl, Br;              for (int i = 0; i < n1 / 2; ++i) {        Al += A[i];        Bl += B[i];        Ar += A[n1 / 2 + i];        Br += B[n1 / 2 + i];    }                    string p = multiply(Al, Bl);          string q = multiply(Ar, Br);              string r = findDiff(        multiply(findSum(Al, Ar),                 findSum(Bl, Br)),        findSum(p, q));          for (int i = 0; i < n1; ++i)        p = p + "0";          for (int i = 0; i < n1 / 2; ++i)        r = r + "0";          string ans = findSum(p, findSum(q, r));          ans = removeLeadingZeros(ans);          return ans;}  int main(){    string A = "74638463789";    string B = "35284567382";      cout