WRITE THE MAIN.CPP FOR THIS PROGRAMa. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2)b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2)2578870135Write a program to test the function you designed.Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found). ```cpptemplateint seqOrdSearch(const elemType list[], int listLength, const elemType& item){ int loc; bool found = false; loc = 0; while(loc < listLength && !found) if (list[loc] == item) found = true; else loc++; if(found) return loc; else return -1; // return -1 if item not found} //end seqOrdSearch```### ExplanationThis C++ code snippet implements a sequential search algorithm for an ordered list. It searches for a specified item (`item`) in a list of elements (`list`) of a given length (`listLength`). - **Template Function:** The function `seqOrdSearch` is a template function, meaning it can handle any data type defined as `elemType`. - **Function Parameters:** - `const elemType list[]`: An array of elements to search through. - `int listLength`: The number of elements in the array. - `const elemType& item`: The item to be searched for in the array.- **Variables:** - `int loc`: Used to traverse the array, initialized to 0. - `bool found`: A flag to indicate if the item is found, initialized to `false`.- **Logic:** - The `while` loop iterates through the list as long as `loc` is less than `listLength` and `found` is `false`. - During each iteration, it checks if the current element `list[loc]` is equal to `item`. If so, `found` is set to `true`. - If the item is found, the function returns the index `loc`. Otherwise, it increments `loc` and continues the search. - If the loop completes without finding the item, the function returns `-1`, indicating that the item is not present in the list. This algorithm is efficient for small to moderately sized ordered lists. However, for larger datasets, other search algorithms like binary search might be more efficient.

Procedure Followed for Sequential Search: Searching starts from left most of the input array. One…

Answered: Write a version of the sequential…

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

See similar textbooks

Related questions

Concept explainers

Question

WRITE THE MAIN.CPP FOR THIS PROGRAM

a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2)

b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145

Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2)

Write a program to test the function you designed.

Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).

```cpp
template<class elemType>
int seqOrdSearch(const elemType list[], int listLength, const elemType& item)
{
int loc;
bool found = false;
loc = 0;
while(loc < listLength && !found)
if (list[loc] == item)
found = true;
else
loc++;
if(found)
return loc;
else
return -1; // return -1 if item not found
} //end seqOrdSearch
```

### Explanation

This C++ code snippet implements a sequential search algorithm for an ordered list. It searches for a specified item (`item`) in a list of elements (`list`) of a given length (`listLength`).

- **Template Function:** The function `seqOrdSearch` is a template function, meaning it can handle any data type defined as `elemType`.

- **Function Parameters:**
- `const elemType list[]`: An array of elements to search through.
- `int listLength`: The number of elements in the array.
- `const elemType& item`: The item to be searched for in the array.

- **Variables:**
- `int loc`: Used to traverse the array, initialized to 0.
- `bool found`: A flag to indicate if the item is found, initialized to `false`.

- **Logic:**
- The `while` loop iterates through the list as long as `loc` is less than `listLength` and `found` is `false`.
- During each iteration, it checks if the current element `list[loc]` is equal to `item`. If so, `found` is set to `true`.
- If the item is found, the function returns the index `loc`. Otherwise, it increments `loc` and continues the search.
- If the loop completes without finding the item, the function returns `-1`, indicating that the item is not present in the list.

This algorithm is efficient for small to moderately sized ordered lists. However, for larger datasets, other search algorithms like binary search might be more efficient.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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.

Similar questions