1 #include 2 using namespace std; 7 8 /** 15 ) 23 24 "/ 12 int find next(int values[], int size, int searched value, int start) Finds the next occurrence of an element in an array. @param values an array of values @param searched value the value to search for @param start the position at which to start the search @return the position of the first match at position > start, or 1 if the element was not found 27 28 29 } int main() int a[] (3, 1, 4, 1, 5, 9, 2, 6); int found at find next(a, 8, 1, 2); cout << "find next(3, 1, 4, 1, 5, 9, 2, 6, 8, 1, 2) << endl; << "Found at: found at << endl; cout << endl; cout << "find next({ 3, found at 1, 4, 1, 5, 9, 2, 6), 8, 7, 3) << endl; find next (a, 8, 7, 3); cout << "Found at: << found at << endl; return 0;

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
# Finding the Next Occurrence of an Element in an Array

In Section 6.2.7, you learned how to find the position of an element in an array. Suppose you want to find the position of the second match. Instead of removing the first match and starting over, you can adapt the algorithm to start the search at a specific position, not zero. Complete the following code:

## find_next.cpp

```cpp
#include <iostream>
using namespace std;

/**
 * Finds the next occurrence of an element in an array.
 * @param values an array of values
 * @param searched_value the value to search for
 * @param start the position at which to start the search
 * @return the position of the first match at position >= start,
 * or -1 if the element was not found
 */
int find_next(int values[], int size, int searched_value, int start)
{
    for (int i = start; i < size; i++)
    {
        if (values[i] == searched_value)
        {
            return i;
        }
    }
    return -1;
}

int main()
{
    int a[] = {3, 1, 4, 1, 5, 9, 2, 6};
    int found = find_next(a, 8, 2, 2);
    cout << "Found at: " << found << endl;
    cout << "Expected: 6" << endl;
    
    found = find_next(a, 8, 1, 1);
    cout << "Found at: " << found << endl;
    cout << "Expected: 3" << endl;
    
    found = find_next(a, 8, 7, 3);
    cout << "Found at: " << found << endl;
    cout << "Expected: -1" << endl;

    return 0;
}
```

### Explanation

**Code Description:**

- **Function: `find_next`**
  - **Parameters:**
    - `values[]`: An array of integers.
    - `size`: The size of the array.
    - `searched_value`: The value you are searching for inside the array.
    - `start`: The index position from which the search should begin.
  - **Returns:** 
    - The position of the first occurrence of `searched_value` at an index `>= start`.
    - Returns `
Transcribed Image Text:# Finding the Next Occurrence of an Element in an Array In Section 6.2.7, you learned how to find the position of an element in an array. Suppose you want to find the position of the second match. Instead of removing the first match and starting over, you can adapt the algorithm to start the search at a specific position, not zero. Complete the following code: ## find_next.cpp ```cpp #include <iostream> using namespace std; /** * Finds the next occurrence of an element in an array. * @param values an array of values * @param searched_value the value to search for * @param start the position at which to start the search * @return the position of the first match at position >= start, * or -1 if the element was not found */ int find_next(int values[], int size, int searched_value, int start) { for (int i = start; i < size; i++) { if (values[i] == searched_value) { return i; } } return -1; } int main() { int a[] = {3, 1, 4, 1, 5, 9, 2, 6}; int found = find_next(a, 8, 2, 2); cout << "Found at: " << found << endl; cout << "Expected: 6" << endl; found = find_next(a, 8, 1, 1); cout << "Found at: " << found << endl; cout << "Expected: 3" << endl; found = find_next(a, 8, 7, 3); cout << "Found at: " << found << endl; cout << "Expected: -1" << endl; return 0; } ``` ### Explanation **Code Description:** - **Function: `find_next`** - **Parameters:** - `values[]`: An array of integers. - `size`: The size of the array. - `searched_value`: The value you are searching for inside the array. - `start`: The index position from which the search should begin. - **Returns:** - The position of the first occurrence of `searched_value` at an index `>= start`. - Returns `
Expert Solution
C++ Program

#include <iostream>
using namespace std;

int find_next(int values[], int size, int searched_value, int start)
{
    for(int i = start; i++; i<size)
    {
        if(values[i] == searched_value);
        return i+1;
    }
}

int main()
{
    int a[] = {3, 1, 4, 1, 5, 9, 2, 6};
    int found_at = find_next(a, 8, 1, 2); 
    cout<< "find_next({3, 1, 4, 1, 5, 9, 2, 6}, 8, 1, 2)"<<endl;
    cout<< "Found at " << found_at<< endl;
    cout<< endl;
    cout<< "find_next({3, 1, 4, 1, 5, 9, 2, 6}, 8, 7, 3)"<<endl;
    found_at = find_next(a, 8, 7, 3);
    cout<< "Found at " << found_at<< endl;
    cout<< endl;

}

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Array
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education