Question

Instructions: You will use two files for this lab: your C program file, and a separate text file containing the integer data values to process. Your program should use a while loop to read one data value each time until all values in the file have been read, and you should design your program so that your while loop can handle a file of any size. You may assume that there are no more than 50 data values in the file. Save each value read from the file and place into the next available position of an array. When all values have been read and saved in the array, other functions will be called to perform the processing tasks on the array. Part 1. Define main and a text input data file, and test your program: Create a text file containing at least 5 different integers, in random order of size. Construct the main function to read all the data in the file and save it in an array. Test your code by printing out all of the values in the array, which should match those in the data file. Be sure to include "explanatory text” (for example: "Values read from the file:") before displaying the values. Part 2. Add and test other functions, one at a time. For each of the following: define the function, call the function from main, and display the results in main, along with "explanatory text”. After all functions have been added and tested, capture a screenshot of the output of your completed program to place in the testing portion of your Lab Report.

#include <stdio.h>

// Define other functions here to process the filled array:  average, max, min, sort, search

// Define computeAvg here

// Define findMax here

// Define findMin here

// Define selectionSort here  ( copy from zyBooks 11.6.1 )

// Define binarySearch here




int main(void) {

   // Declare variables
   FILE* inFile = NULL;   // File pointer
   int singleNum;         // Data value read from file
   int valuesRead;        // Number of data values read in by fscanf
   int counter=0;         // Counter of values read and saved in array
   int arrOfValues[50];   // Array to store values read in from file
   double avgOfArray;     // Average of all values saved in the array
   int maxValue;          // Largest value in the array
   int minValue;          // Smallest value in the array
   int i;

   // Try to open file
   printf("Opening file myfile2.txt.\n");
   inFile = fopen("myfile2.txt", "r");

   if (inFile == NULL) {
      printf("Could not open file myfile.txt.\n");
      return -1; // -1 indicates error
   }

   // Print read numbers to output
   printf("Reading and printing numbers.\n");

   while (!feof(inFile)) {
     valuesRead = fscanf(inFile,"%d", &singleNum);
     if ( valuesRead == 1 ) {
         printf("value read in was:%d\n", singleNum);
         arrOfValues[counter] = singleNum;
         counter++;
     }
   }

   printf("Closing file myfile.txt.\n");

   // Done with file, so close it
   fclose(inFile);

   /* Below, call each function defined above main and display the returned result. For  selectionSort function, it will not return a value, but will sort the values in the array. After calling selectionSort function, use a loop to display all the values in the array to verify they have been sorted. After call the binarySearch function, test the returned value and either display a message stating that the value could not be found, or used the returned value to access and display the value. */

   
   return 0;
}

Answer 1

Note: Could you plz go through this code and let me know if u need any changes in this.Thank You
=================================

We have to store the input file in "bin" folder C:\Program Files (x86)\Dev-Cpp MinGW64\bin As I installed Dev C++ in C Drive this is path. If u have installed Dev C++ in another drive just check for the "bin" in that drive Ex: Suppose I have to read the data from "testscores.txt", We have to copy that file in "bin" folder of Dev C++ like as below. > This PC > Windows (C:) > Program Files (x86) > Dev-Cpp > MinGW64 > bin Name Date modified Type Size testscores 10/28/2019 2:02 A... Text Document 1 KB

// myfile2.txt (input file)

34
45
56
67
78
89
91
21
32

=================================

#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>
#include <stdbool.h>

// Define other functions here to process the filled array: average, max, min, sort, search

// Define computeAvg here
double computeAvg(int arr[],int count);
// Define findMax here
int findMax(int arr[],int count);

// Define findMin here
int findMin(int arr[],int count);

// Define selectionSort here ( copy from zyBooks 11.6.1 )
void selectionSort(int arr[],int count);

// Define binarySearch here
int binarySearch(int arr[],int count,int key);

int main(void) {

// Declare variables
FILE* inFile = NULL; // File pointer
int singleNum; // Data value read from file
int valuesRead; // Number of data values read in by fscanf
int counter=0; // Counter of values read and saved in array
int arrOfValues[50]; // Array to store values read in from file
double avgOfArray; // Average of all values saved in the array
int maxValue; // Largest value in the array
int minValue; // Smallest value in the array
int i;

// Try to open file
printf("Opening file myfile2.txt.\n");
inFile = fopen("myfile2.txt", "r");

if (inFile == NULL) {
printf("Could not open file myfile.txt.\n");
return -1; // -1 indicates error
}

// Print read numbers to output
printf("Reading and printing numbers.\n");

while (!feof(inFile)) {
valuesRead = fscanf(inFile,"%d", &singleNum);
if ( valuesRead == 1 ) {
printf("value read in was:%d\n", singleNum);
arrOfValues[counter] = singleNum;
counter++;
}
}

printf("Closing file myfile.txt.\n");

// Done with file, so close it
fclose(inFile);

/* Below, call each function defined above main and display the returned result. For selectionSort function, it will not return a value, but will sort the values in the array. After calling selectionSort function, use a loop to display all the values in the array to verify they have been sorted. After call the binarySearch function, test the returned value and either display a message stating that the value could not be found, or used the returned value to access and display the value. */
avgOfArray=computeAvg(arrOfValues,counter);
maxValue=findMax(arrOfValues,counter);
minValue=findMin(arrOfValues,counter);
selectionSort(arrOfValues,counter);
printf("Enter a number to search :");
scanf("%d",&singleNum);
int index=binarySearch(arrOfValues,counter,singleNum);
printf("Average of array :%.2f\n",avgOfArray);;
printf("Maximum value in the array :%d\n",maxValue);
printf("Minimum value in the array :%d\n",minValue);
if(index==-1)
{
    printf("The number %d not found.\n");
}
else
{
       printf("The number %d is found at index %d\n",singleNum,index);
}


return 0;
}

// This function will compute the average of array
double computeAvg(int arr[],int count)
{
   int i;
   double sum=0;
   for(i=0;i<count;i++)
   {
       sum+=arr[i];
   }
   return sum/count;
}

// This function will find the maximum value in the array
int findMax(int arr[],int count)
{
   int i;
   int max=arr[0];
   for(i=0;i<count;i++)
   {
       if(max<arr[i])
       max=arr[i];
   }
   return max;  
}

// This function will find the minimum value in the array
int findMin(int arr[],int count)
{
   int i;
   int min=arr[0];
   for(i=0;i<count;i++)
   {
       if(min>arr[i])
       min=arr[i];
   }
   return min;  
}

// This function will sort the array
void selectionSort(int arr[],int count)
{
   int minIndex,i,j;
  
for (i = 0; i < count - 1; i++) {
// find smallest element in list starting at location i
minIndex = i;
for (j = i + 1; j < count; j++)
if (arr[j] < arr[minIndex])
minIndex = j;
// swap list[i] with smallest element
int temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = temp;
}

}

// This function will search for value using binary Search Algorithm
int binarySearch(int arr[],int count,int target)
{ int size =count;
int first = 0, last = size - 1, middle, position = -1;
bool found = false;
while (!found && first <= last) {
middle = (first + last) / 2;
if (arr[middle] == target) {
position = middle;
return position;
} else if (arr[middle] > target)
last = middle - 1;
else
first = middle + 1;
}
return position;
}

=============================================

Output:

C:\Program Files (x86)\Dev-Cpp\MinGW64\bin\ReadFileMinMaxAverageSelection SortBinarySearch.exe Opening file myfile2.txt. Reading and printing numbers. value read in was:34 value read in was:45 value read in was:56 value read in was:67 value read in was:78 value read in was: 89 value read in was:91 value read in was:21 value read in was:32 Closing file myfile.txt. Enter a number to search :45 Average of array :57.00 Maximum value in the array :91 Minimum value in the array :21 The number 45 is found at index 3 Process exited after 6.943 seconds with return value o Press any key to continue ..

=====================Could you plz rate me well.Thank You