Question

Write a recursive function called sumover
that has one argument n, which is an
unsigned integer. The function returns a
double value, which is the sum of the reciprocals of
the first n positive integers. (The reciprocal of x is
the fraction 1/x.) For example, sumover(1) returns
1.0 (which is 1/1); sumover(2) returns 1.5 (which
is 1/1 + 1/2); sumover(3) returns approximately
1.833 (which is 1/1 + 1/2 + 1/3). Define
sumover(0) to be zero. Do not use any local variables
in your function.

Submit output for when n=290

Implement the recursive function isPal(), which determines whether a string str is a simple palindrome. A simple palindrome is a string consisting entirely of the characters a-z that reads the same forward and backward. For instance, the upcoming are palindromes: dad, level, mom, madamimadam, gohangasalamiimalasagnahog. Use the following declaration of isPal(): bool isPal (const string& str, int startIndex, int endIndex); It returns true when the substring in the index range [startIndex, endIndex) is a palindrome. The conditions are Stopping Condition: Result is true when startIndex >= endIndex -1 Result is false when str[startIndex] != str[endIndex-1] Recursive Step: Determine whether the substring of the str in the index range [startIndex+1, endIndex-1] is a palindrome

Answer 1

Screenshot of code1:

Output:

code:

#include<iostream>
using namespace std;
double sumover(unsigned int n)
{
double s=0.0;
for(int i=1;i<=n;i++)
s+=(1/(1.0*i));
return s;
}
int main()
{
unsigned int n;
cout<<"Enter n: ";
cin>>n;
cout<<"sum is: "<<sumover(n);
}

Screenshot of code2:

Output:

code:

#include<iostream>
using namespace std;
bool isPal (const string& str, int startIndex, int endIndex)
{
for(int i=startIndex;i<=endIndex;i++)
{
if(str[i]!=str[endIndex-i])
return false;
}
return true;
}
int main()
{
string s;
int start,end;
cout<<"Enter string: ";
cin>>s;
cout<<"Enter start and end index: ";
cin>>start>>end;
bool k=isPal(s,start,end);
if(k==1)
cout<<"TRUE";
else
cout<<"FALSE";
}

//please upvote.