Question

C++ code

The assignment has two input files:
• LSStandard.txt
• LSTest.txt
The LSStandard.txt file contains integer values against which we are searching. There will be no more than
100 of these. The LSTest.txt file contains a set of numbers that we are trying to locate within the standard data
set. There will be no more than 50 of these.
Read both files into two separate arrays.
Your program should then close both input files.
All subsequent processing will be done on the arrays only.
Use each number in the search value array from the LSTTest.txt file as a search value to search over the standard
array that contains the data set from the LSStandard data file. This search is accomplished by a function using a
Linear Search algorithm on the array that contains the standard data set.

Have your program display out a report to the console that indicates whether the number was found or not.
Your output should look something like:
Number 1 ( 79) was located at index 44.
Number 2 ( 74) was not in the file.
Number 3 ( 56) was not in the file.
Number 4 (103) was located at index 75.
etc.
Note that the number for which we searched is indicated in parenthesis in the display report. The index number refers to the index of the element within the stdList array data where the search value was found.
Your function header for the Linear Search function should look like:
int searchList(int stdList [], int numElems, int searchValue)
You’ll notice that this function accepts an array as input parameter. That array, called stdList in the parameter list, will be the array that contains the standard data set. The parameter numElems is the number of elements in that array, and the parameter searchValue is the element that we are searching for.
Your function should search for searchValue within the stdList array and return one of two answers:
• a -1 if value is not in stdList array
• if searchValue is in stdList, the index position of searchValue within the stdList array.
This should be a number between 0 and numElems-1.
Your program should then use this result to determine what should be displayed in the report.
Note that some of the numbers in LSTest appear more than once in LSStandard. This Linear Search algorithm will return the first found instance.

Thank you

Answer 1

Program code to copy:-

#include <iostream>   //Used for standard input/output
#include <cstdlib>   //used for exit() function
#include <fstream>   //used for input file stream

using namespace std;

//Function prototype
int searchList(int stdList [], int numElems, int searchValue);

int main()
{
   //Decalring array to store data set read from standard file
    int stdArray[100];
    //Decalring array to store data set read from test file
    int testArray[50];

    //Decalring input file stream object
    ifstream stdFile, testFile;
   
   //Open the standard file for reading
    stdFile.open("LSStandard.txt");
    //Checking whether the file is opened successfully or not
    if(!stdFile)
   {
   cout << "LSStandard.txt file can not opened for reading" << endl;
    exit(0);
    }
   
    int i=0;
    //Loop will be executed till end of file
   while(!stdFile.eof())
    {
    //Reading each number from standard file into array
stdFile >> stdArray[i];
i++;
    }
   //Closing standard file
   stdFile.close();
   //Storing total numbers read from standard file
   int numElemsStd = i;
   
  
   //Open the test file for reading
    testFile.open("LSTest.txt");
    //Checking whether the file is opened successfully or not
    if(!testFile)
   {
   cout << "LSTest.txt file can not opened for reading" << endl;
    exit(0);
    }
   
    i=0;
    //Loop will be executed till end of file
   while(!testFile.eof())
    {
    //Reading each number from test file into array
testFile >> testArray[i];
i++;
    }
   //Closing test file
   testFile.close();
   //Storing total numbers read from test file
   int numElemsTest = i;
  
  
int index;
for(int i=0; i<numElemsTest; i++)
{
//Calling function for each element of test array to search it in standard array
index = searchList(stdArray, numElemsStd, testArray[i]);
  
if(index != -1)
{
//Display details of each number of test array if found in an standard array
cout << "Number " << (i+1) << " " << "(" << testArray[i] << ")"
<< " was located at index " << index << endl;
}
else
{
//Display details of each number of test array if not found in an standard array
cout << "Number " << (i+1) << " " << "(" << testArray[i] << ")"
<< " was not in the file" << endl;
}
  
}
  
return 0;
}

//Function search for searchValue within the stdList array and
//return one of two answers: -1 if value is not in stdList array or
//if searchValue is in stdList, the index position of searchValue within the stdList array.
//Function accepts three parameters:-
//1. An array that contains the standard data set.
//2. The parameter numElems is the number of elements in that array.
//3. The parameter searchValue is the element that we are searching for.
int searchList(int stdList[], int numElems, int searchValue)
{
for(int i=0; i<numElems; i++)
{
if(stdList[i]==searchValue)
//Returns index value of number if found in standard array
return i;
}
//Returns -1 if not found in standard array
return -1;
}

Screenshot of output:-

Number 1 (33) was located at index 2 Number 2 (16) was not in the file Number 3 (40) was located at index 5 Number 4 (76) was not in the file Number 5 (45) was located at index 9 Number 6 (51) was located at index 11 Number 7 (37> was located at index 13 Number 8 (82) was located at index 15 Number 9 (77) was located at index 17 Number 10 (39) was not in the file

Screenshot of content of file named "LSStandard.txt" used in the program:-

LSStandard - Notepad File Edit Format View Help 44 78 33 10 20 40 100 110 70 45 19 51 23 37 97 82 88 77 11 5

Screenshot of content of file named "LSTest.txt" used in the program:-

LSTest - Notepad File Edit Format View Help 33 16 40 76 45 51 37 82 77 39