Question
C PROGRAM PLEASE!! Write two functions, first and last described as follows; the function first takes a string s and a character c as arguments
C PROGRAM PLEASE!!
Write two functions, first and last described as follows; the function first takes a string s and a character c as arguments and returns a pointer to (i.e. the address of) the first occurrence of the character c in the string s. That is, if s = "A string to be searched" and c = e, then the function first returns a character pointer which is the address of the e in the word "be". If the character does not occur in the string s then the value NULL is returned. the function last takes a string s and a character c as arguments and returns a pointer to (i.e. the address of) the last occurrence of the character c in the string s. That is, if s = "A string to be searched" and c = e, then the function last returns a character pointer which is the address of the e just before the d in the last word. Again, if the character does not occur in the string then the NULL pointer is returned. Write a main program which defines a string, str, which contains the sentence A string to be searched. Your program should then prompt the user for the character to search for, c. The functions first and last are then called with str and c as arguments and the resulting strings (starting at the returned pointers) are printed to an output file. For example, if you type in the letter s as the character to search for, your program should print out Original string: A string to be searched First occurrence of s starts the string: string to be searched Last occurrence of s starts the string: searched Test your program using the characters r, e and q. Note that the last should give the error message: Character q not found
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started