The sequential search algorithm searches a list for a given item, starting with

Question

The sequential search algorithm searches a list for a given item, starting with the first element in the list. It continues to compare the search item with the other elements in the list until either the item is found or the list has no more elements left to be compared with the search item. Implement a program that search for a value that is entered by the user in an array. The program should print a success message and tell the user the location of the value in the array in case it finds that value. Otherwise, should state that the value does not exist in the array. Then, extend the problem so that it searches for a value in a file.

Explanation / Answer

#include <iostream>
using namespace std;
int search(int arr[], int l, int r, int x)
{
if (r >= l)
{
int mid = l + (r - l)/2;

if (arr[mid] == x)
return mid;

if (arr[mid] > x)
return search(arr, l, mid-1, x);

return search(arr, mid+1, r, x);
}

return -1;
}

int main()
{
int n;
cout<<" Size of array: ";
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}

int x;
cout<<" Number to search: ";
cin>>x;

int result = search(arr, 0, n-1, x);
(result == -1)? cout<<" Element is not present in array"
: cout<<" Element is present at index: "<<result;
return 0;
}?

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.