Answer:
The program in recursion is:
def find_max(nums):
if len(nums) == 0:
return "None"
elif len(nums) == 1:
return nums[0]
else:
return max(nums[0],find_max(nums[1:]))
Explanation:
This line defines the function
def find_max(nums):
This checks if the list is empty.
if len(nums) == 0:
If yes, it returns "None"
return "None"
If the list has just one element
elif len(nums) == 1:
It returns the only element as the maximum
return nums[0]
If the list has numerous elemente
else:
The maximum is determined recursively
return max(nums[0],find_max(nums[1:]))
To the (b) part:
<em>This program does not necessarily need to be done recursively because the max built-in function can be used to determine the maximum of the list in just one line of code and it is more efficient.</em>
Explanation:
A computer's speed and processing power aren't attributable to a single component. It takes a number of pieces of hardware working together to determine your computer's overall performance. The key is how well, and how quickly, all the important components communicate with each other to perform actions.
Answer:
the speakers note
Explanation:
when putting it in presenter view it'll have a separate window so you'll have access and see speaker notes etc
Answer:
The function written in C++
int str(string word)
{
int count = 1;
for(int i =0; i<word.length();i++)
{
if(word[i] == ' ')
{
count++;
}
}
return count;
}
Explanation:
This line defines the function
int str(string word)
{
This line initializes count to 1
int count = 1;
This line iterates through the input string
for(int i =0; i<word.length();i++)
{
This line checks for blank space
if(word[i] == ' ')
{
Variable count is incremented to indicate a word count
count++;
}
}
return count;
}
<em>See attachment for full program</em>
