Question

The name of the C++ file must be search.cpp Write a program that will read data from a file. The program will allow the user to specify the filename. Use a loop that will check if the file is opened correctly, otherwise display an error message and allow the user to re-enter a filename until successful. Read the values from the file and store into an integer array. The program should then prompt the user for an integer which will be searched for in the array using binary search. Make sure to include the following A sort function must be called before the binary search. Implement the selection sort function that uses findMin and swap functions as discussed in lecture Include a function called by main to implement the binary search The ordered array produced by the sort function should be passed to the search routine which returns the location in the sorted array of the sought value, or -1 if the value is not in the array Add a value returning function that computes the median of your data set. (i.e. main function will display the median) -Use showArray function to show elements of the array before sorting and after sorting as required in the program output. The function should display the array values nicely formatted n rows Your program should output The total number of elements read from the file (valid items in the array) The array as read from the file The sorted array The integer being searched for and the location of that integer in the sorted array (or an - - - appropriate message if it is not in the array) -The median of the data set Assume that the maximum number of values in the input file wll not exceed 50. Sample input file: data.dat

Answer 1

Answer :

C++ Code:

#include <iostream>
#include <fstream>
using namespace std;
void swap(int *xp, int *yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}
int findMin(int numbers[], int i, int minx, int n){
for (int j = i+1; j < n; j++)
if (numbers[j] < numbers[minx])
minx = j;
return minx;
}
void selectionSort(int numbers[], int n)
{
int i, j, minx;
for (i = 0; i < n-1; i++)
{
minx = i;
minx = findMin(numbers, i, minx, n);
swap(&numbers[minx], &numbers[i]);
}
}
int binarySearch(int numbers[], int l, int r, int x)
{
if (r >= l)
{
int mid = l + (r - l)/2;
if (numbers[mid] == x)
return mid;
if (numbers[mid] > x)
return binarySearch(numbers, l, mid-1, x);
return binarySearch(numbers, mid+1, r, x);
}
return -1;
}
int median(int numbers[], int n){
int m = 0;
if ((n % 2) == 0)
m = (numbers[n/2] + numbers[(n/2) - 1])/2.0;
else
m = numbers[n/2];
return m;
}
void showArray(int numbers[], int n){
for(int i = 0; i < n;i++)
cout << numbers[i] << " ";
}
int main()
{
int n;
fstream myfile("data.dat", ios_base::in);
int size = 50;
int a[size], i = 0;
while (myfile >> n)
{
a[i] = n;
i++;
}
selectionSort(a, size);
int result = binarySearch(a, 0, size-1, 7);
if(result == -1)
cout << "Number not found\n";
else
cout << "Number found at " << result << endl;
cout << "Median of the array is " << median(a, size)<< endl;
showArray(a, size);
return 0;
}