A program that counts the number of times a character sequence occurs in another character sequence

computer science

Description

A program that counts the number of times a character sequence occurs in another character sequence. Create a function, 'pattern' to do this: int pattern(char *ptr1, char *ptr2) In the main function, declare two character arrays and initialize to the following sequence: '1','1','0','1','0','0','1','1','1','0','1','1','' '1','0','1','' Call the 'pattern' function and pass the first character array as the argument for ptr1, and the second character array as the argument for ptr2. The 'pattern' functions should return the the number of times the first sequence occurs in the second sequence without repeating (which is 2). In the pattern, functions you are not allowed to use brackets [] to dereference the pointers. You must only use pointer arithmetic. Also you are not allowed to hard code the length of the arrays (you must 'sense' when a pointer has reached the end of the array).

Instruction Files

Related Questions in computer science category


Disclaimer
The ready solutions purchased from Library are already used solutions. Please do not submit them directly as it may lead to plagiarism. Once paid, the solution file download link will be sent to your provided email. Please either use them for learning purpose or re-write them in your own language. In case if you haven't get the email, do let us know via chat support.