I really need help in this it makes me confuse.I should make a program to find a pattern...so can somebody help me...
Write a function to recognize an pattern within another array. Your function should have the following prototype.
const int *find_pattern_in_int_array(const int *pattern, const int *array);
There are two parameters. The first one is pattern, which is an int pointer that points to the starting address of the pattern. The pattern ends with an int 0. The second parameter is the int array within which you need to locate the pattern. The array also ends with an int 0. If the pattern can be found in array, return the start address of last one within array. Otherwise you just return NULL. Note that you cannot access out of the array bound so you need to pay attention to the length of the pattern and the array, since the length of the array is not necessarily smaller than the length of the pattern.
You only need to write the function. The grading system will use various main programs to test the correctness of you function.
Please submit the function with #include<stdio.h>. DO NOT submit code with int main().
Sample Input/Output 1
Let's suppose you have pattern pointing to {8, 7, 0} and array pointing to {1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}.
In this case, you should return a pointer pointing to the second 8.
Sample Input/Output 2
pattern : {1, 2, 1, 0}
array : {1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}.
In this case, you should return NULL.
The confusion may be coming from trying to take in too many things at once.
At root, all this is asking is for you to write a function to find a sequence like {8, 7} in a sequence like (1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 1} - which is essentially the same process as finding "the" in "I thought the problem was harder than it was."
I'd focus on finding the sequence, get the general approach clear in my head, and then worry about the details and the bureaucracy.
How do you find a sequence - pattern - within another sequence - array? In general, you can:
1. Look along array, looking for the first element of pattern (loop through array looking for 8)
2. When you've found the start of pattern in array, compare subsequent elements in both to see if they are the same.
3. Keep doing this until you've reached the end of array. The last one you found is the answer, or NULL if none found.
It's the same logic that's used in strstr(), for example, to find "wo" in "hello, world". They're just using arrays of integers here, which are less familiar than arrays of chars, but really very little else is different.
Don't get hung up on the const. It just means that the values specified can be read, but not changed.
You can't include your main() in your project, but if I were doing this, the first thing I'd do would be to write that main() using the first example - something like
const int *find_pattern_in_int_array(const int *pattern, const int *array);
int main()
{
const int pattern[] = {8, 7, 0};
const int array[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
int *return_value;
return_value = find_pattern_in_int_array(pattern, array);
}
to provide me a testbed for the function.
Does this help any? If you want to provide some code or ask a specific question, I'm sure I or somebody here will be happy to have a look at it.
Sure, I can help you with that. The task is to write a function that finds a pattern within another array, using the given prototype:
```c
const int *find_pattern_in_int_array(const int *pattern, const int *array);
```
The function takes two parameters: `pattern`, which is a pointer to the starting address of the pattern, and `array`, which is a pointer to the int array in which you need to locate the pattern. Both `pattern` and `array` are terminated with a zero (0).
Here is how you can approach this problem:
1. Initialize two variables:
- `pattern_length`: to store the length of the pattern by iterating through `pattern` until you find a zero (0).
- `array_length`: to store the length of the array by iterating through `array` until you find a zero (0).
2. Iterate through the `array` starting from the first element:
- Check if the current element matches the first element of the `pattern`.
- If it does, compare the remaining elements of the `pattern` with the corresponding elements in the `array`.
- If the pattern matches completely, return a pointer pointing to the start address of the last occurrence of the pattern within the `array`.
3. If the pattern is not found in the `array`, return `NULL`.
Here's an example implementation in C:
```c
#include <stdio.h>
const int *find_pattern_in_int_array(const int *pattern, const int *array) {
// Calculate the length of the pattern
int pattern_length = 0;
while (pattern[pattern_length] != 0) {
pattern_length++;
}
// Calculate the length of the array
int array_length = 0;
while (array[array_length] != 0) {
array_length++;
}
// Iterate through the array to find the pattern
for (int i = 0; i <= array_length - pattern_length; i++) {
int j = 0;
while (j < pattern_length && array[i + j] == pattern[j]) {
j++;
}
if (j == pattern_length) {
return (array + i + j - 1); // return pointer to the last occurrence of the pattern
}
}
return NULL; // pattern not found
}
int main() {
// Sample Input/Output 1
const int pattern1[] = {8, 7, 0};
const int array1[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
const int *result1 = find_pattern_in_int_array(pattern1, array1);
if (result1 != NULL) {
printf("Pattern found at index: %ld\n", result1 - array1);
} else {
printf("Pattern not found.\n");
}
// Sample Input/Output 2
const int pattern2[] = {1, 2, 1, 0};
const int array2[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
const int *result2 = find_pattern_in_int_array(pattern2, array2);
if (result2 != NULL) {
printf("Pattern found at index: %ld\n", result2 - array2);
} else {
printf("Pattern not found.\n");
}
return 0;
}
```
Output:
```
Pattern found at index: 8
Pattern not found.
```
I hope this explanation helps you understand the problem and how to solve it. Let me know if you have any further questions!