Write a program whose input is a character and a string, and whose output indicates the number of times the character appears in
the string.
Ex: If the input is:
n Monday
the output is:
1
Ex: If the input is:
z Today is Monday
the output is:
0
Ex: If the input is:
n It's a sunny day
the output is:
2
Case matters. n is different than N.
Ex: If the input is:
n Nobody
the output is:
0
Your program must define and call the following function that returns the number of times the input character appears in the input string. int CountCharacters(char userChar, string userString)
Ex: If the input is:
n Monday
the output is:
1
Ex: If the input is:
z Today is Monday
the output is:
0
Ex: If the input is:
n It's a sunny day
the output is:
2
Case matters. n is different than N.
Ex: If the input is:
n Nobody
the output is:
0
Your program must define and call the following function that returns the number of times the input character appears in the input string. int CountCharacters(char userChar, string userString)
1 answer:
You might be interested in
Answer:
p(x,n)
1. if(n==0) [if power is 0]
2. then result =1.
3.else
4. { result=1.
5. for i=1 to n.
6. { result = result * x. } [each time we multiply x once]
7. return result.
8. }
Let's count p(3,3)
30, so come to else part.
i=1: result = result *3 = 3
i=2: result = result *3 = 9
i=2: result = result *3 = 27
Explanation:
here the for loop at step 4 takes O(n) time and other steps take constant time. So overall time complexity = O(n)