Question

follow the instructions inside.

You are to implement the sequential search of array elements.

User will enter a value (size) which represents the number of values to process

The values entered will be stored in an array of type short that has 1000 elements

User will enter size numbers

The user will enter a search value

The program will search the data for a specific value

program will display a message in which element the value was found or display a message the value was not found

*/

#include<iostream> // required header file for input/output

using namespace std;

// function prototypes
void input_data(short data[], short size);
void sequential_search(short data[], short size, short search_value, short &offset);

int main()
{ // declare local variables
  
int search_again;
  
// input the number of values to store in the array
  
// call the function to input the data into the array
  
do // posttest loop (will execute at least one time)
{
  
// input a search value
  
// call sequential_search function
  
// display a message to output the element # where search value was found or message value not found
  
  
cout<<"To search for another number enter the digit 1 otherwise enter the digit 0 ";
  
cin>>search_again;
  
} while(search_again != 0);
  
  
  
return 0;
  
}

// function definitions are placed after main
// Do not output anything from these functions
// Function to input(store) data into the array
void input_data(short data[], short size)
{ /*code in function*/ }

// Function to search the array using a sequential search
// Assign the subscript/element # to offset where found or assign offset -1 if not found.
void sequential_search(short data[], short size, short search_value, short &offset)//

{ /*code in function*/ }

Answer 1

`Hey,

Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries

#include<iostream>// required header file for input/output

using namespace std;

// function prototypes

void input_data(short data[], int size);
void sequential_search(short data[], short size, short search_value, short &offset);

int main() {
// declare local variables

int search_again = 1, size;
short data[100], search_value;

// input the number of values to store in the array
cout<<"\nEnter size of the array : ";
cin>>size;

// call the function to input the data into the array
cout<<"\nEnter "<<size<<" elements one by one : ";
input_data(data, size);
short offset;
// call the function to sort the data in ascending order

do // posttest loop (will execute at least one time)
{
// input a search value
cout<<"\nEnter a value to search in the array : ";
cin>>search_value;

// call binarySearch function
sequential_search(data, size, search_value,offset);
// display a message to output the element # where search value was found or message value not found
if(offset!=-1)
cout<<"\n"<<search_value<<" was found at index "<<offset<<endl;
else
cout<<"Number not found"<<endl;
cout<<"\n\nTo search for another number enter the digit 1 otherwise enter the digit 0 : ";
cin>>search_again;

} while(search_again != 0);

cout<<"\n";
return 0;

}

//function definitions are placed after main

// Do not output anything from these functions

// Function to input(store) data into the array

void input_data(short data[], int size) {
for(int i =0; i<size; i++) {
cin>>data[i];
}

}
void sequential_search(short data[], short size, short search_value, short &offset) {
for (short i=0;i<size;i++)
{
if (data[i] == search_value) {
offset = i;
return;
}

}
offset = -1;
}

Kindly revert for any queries

Thanks.