Question

* This program illustrates how to use a sequential search to find the position of the first apparance of a number in an array

TODO#6: change the name to your name and date to the current date * * Created by John Doe, April 17 2019 */ #include using namespace std; //global constant const int ARRAY_SIZE = 10; //TODO#5: provide the function prototype for the function sequentialSearch int main() { //TODO#1: declare an integer array named intList with size of ARRAY_SIZE, no initialization int number; //hold the number to be searched in the array int position = -1; //hold the position where the number is in the array cout << "Please enter " << ARRAY_SIZE << " integers." << endl; //TODO#2: request the values of the array intList from user //hint: use a for loop, request for one element in each iteration cout << "\nPlease enter the number to be searched: "; cin >> number; cout << endl; //TODO#3: call function sequentialSearch to return the position where the number is in the array if (position != -1) cout << number << " is found at index " << position << endl << endl; else cout << number << " is not in the list." << endl << endl; return 0; } //end main function //function definition for sequential search //search the array from the first element sequentially till //find the item, and return the position, or //could not find the item, so return -1 int sequentialSearch(const int list[], int listLength, int searchItem) { int loc = 0; //the first position to be checked in the array is 0 bool found = false; //initially the number has not been found while (loc < listLength && !found) { //TODO#4: access each element of the array list[] (index is loc) //compare it with the given number (searchItem) //if match, found it, set found to true //if not match, increment loc and go to the next iteration } if (found) return loc; //found the number in the array, return the position else return -1; //the number is not in the array } //end function sequentialSearch

Answer 1

#include <iostream>

using namespace std;

const int ARRAY_SIZE = 10;

int sequentialSearch(const int[], int, int);

int main()

{

int list[ARRAY_SIZE];

int position = -1;

int number;

cout << "Please enter " << ARRAY_SIZE << " integers: " << endl;

for(int i = 0; i < ARRAY_SIZE; i++)

{

cin >> list[i];

}

cout << endl << "Please enter the number to be searched: ";

cin >> number;

position = sequentialSearch(list, ARRAY_SIZE, number) + 1;

if(position != -1)

{

cout << endl << number << " is found at index " << position << endl;

}

else

cout << endl << number << " is not in the list." << endl;

return 0;

}

int sequentialSearch(const int list[], int listLength, int searchItem)

{

bool found = false;

int loc = 0;

while (loc < listLength && !found)

{

if(list[loc] == searchItem)

{

found = true;

break;

}

else

loc++;

}

if(found)

return loc;

else

return -1;

}

*********************************************************************** SCREENSHOT ****************************************************