This is to be done in C Educational Objectives After success

This is to be done in C++:

Educational Objectives: After successfully completing this assignment, the student should be able to accomplish the following:

Use a loop structure to read user input of unknown size through std::cin and store it in an array.

Use conditional branching to selectively perform computational tasks.

Declare (prototype) and define (implement) functions.

Declare and define functions with arguments of various types, including pointers, references, const pointers, and const references.

Call functions, making appropriate use of the function arguments and their types.

Make decisions as to appropriate function call parameter type, from among: value, reference, const reference, pointer, and const pointer.

Create, edit, build and run multi-file projects using the Linux/Emacs/Make environment announced in the course organizer.

Operational Objectives: Create a project that computes the mean and median of a sequence of integers received via standard input.

Deliverables: Files: stats.h, stats.cpp, main.cpp, makefile, log.txt. Note that these files constitute a self-contained project.

Background

Given a finite collection of n numbers:

The mean is the sum of the numbers divided by n, and

The median is the middle value (in case n is odd) or the average of the two middle values (in case n is even).

Note that to find the median of a collection of data, it is convenient to first sort the data, that is, put the data in increasing (or non-decreasing) order. Then the median is just the middle datum in the sorted sequence (or the average of the two middle data, if there are an even number).

One of the more intuitive sort algorithms is called Insertion Sort, which operates on an array a[0..n-1] of elements. The idea is to \"insert\" the value of a[i] into the sub-array a[0..i-1] at the largest possible index that results in the expanded sub-array a[0..i] sorted. We insert at the highest possible index in order not to place the value ahead of any previously inserted elements with the same value. The subarray a[0..i-1] is assumed to be sorted at the beginning of each insertion step. The base case consists of a one-element array a[0..0], which is always sorted.

Here is a \"pseudocode\" description of the algorithm:

The inner loop copies all elements in a[0..i-1] up one index until the correct place for t is found. Then put t in that place.

Procedural Requirements:

Begin a log file named log.txt. This should be an ascii text file in cop3330/proj1 with the following header:

This file should document all work done by date and time, including all testing and test results.

Create and work within a separate subdirectory cop3330/proj1. Review the COP 3330 rules found in Introduction/Work Rules.

Copy all of the files from LIB/proj1. These should include:

In addition you should have the script submit.sh in either your .bin or your proj1 as an executable command.

Create three more files

complying with the Technical Requirements and Specifications stated below.

Turn in four files stats.h, stats.cpp, main.cpp, and makefile using the submit script.

Warning: Submit scripts do not work on the program and linprog servers. Use shell.cs.fsu.edu to submit projects. If you do not receive the second confirmation with the contents of your project, there has been a malfunction.Technical Requirements and Specifications

The project should compile error- and warning-free on linprog with the command make stats.x.

The number of integers input by the user is not known in advance, except that it will not exceed 100. Numbers are input through standard input, either from keyboard or file re-direct. The program should read numbers until a non-digit or end-of-file is encountered or 100 numbers have been read.

Once the input numbers have been read, the program should calculate the mean and median and then report these values to standard output.

The source code should be structured as follows:

Implement separate functions with the following prototypes:

I/O is handled by function main(); no other functions should do any I/O

Function main() calls Mean() and Median()

Function Median() calls Sort()

The source code should be organized as follows:

Prototypes for Mean, Median, and Sort should be in file stats.h

Implementations for Mean, Median, and Sort should be in file stats.cpp

Function main should be in file main.cpp

The Sort() function should implement the Insertion Sort algorithm.

When in doubt, your program should behave like the distributed executable example stats_i.x in area51. Identical behavior is not required, but the general I/O behavior should be the same. In particular, the data input loop should not be interupted by prompts for a next datum - this will make file redirect cumbersome. Just ask for the data one time, then read until a non-digit or end of file is encountered.

Hints
To run a sample executable, follow these steps: (1) Copy the appropriate executable into your space where you want to run it: log in to linprog and enter the command \"cp [LIB]/area51/stats_i.x .\". (2) Change permissions to executable: \"chmod 700 stats_i.x\". (3) Execute by entering the name of the executable. If you want to run it on a data file \"data1\", use input redirect as in: \"stats_i.x < data1\". If you want the output to go to another file, use output redirect: \"stats_i.x < data1 > data1.out\".

A working makefile is distributed and may be used in the submission - provided that you have read and understood the makefile, so that when a makefile is required in the future you will know how to create one.

Test files can be created using the program ranint.cpp, which is distributed as part of the assignment and is compiled by the supplied makefile. To create random data files for testing, first build ranint.x with the command

and then execute. Note that the program expects 3 command line arguments - (1) file name, (2) upper bound on size of integers, and (3) number of elements to generate. It will remind you if you forget. Here are examples:

(Forgot to give arguments.)

The less-than character in the command:
     stats.x < data1
is a Unix/Linux operation that redirects the contents of data1 into standard input for stats.x. Using > redirects program output. For example, the command:
     stats.x < data1 > data1.out
sends the contents of data1 to standard input and then sends the program output into the file data1.out. These are very handy operations for testing programs.

It is sometimes simpler to develop the code in a single file (such as project.cpp) that can be edited in one window and test-compiled with a single command (such as g++ -Wall -Wextra -ostats.x project.cpp) and split the file up into the deliverables after the initial round of testing and debugging.

Note that the array in which input is stored is passed to the functions as a pointer. In the case of Mean(), this pointer is const, indicating that the elements of the array may not be changed by the call. However in the case of Median(), the array element values are allowed to change. These values are in fact changed by the call toSort().

The function Sort() operates on the array input as a pointer. When the function returns, the values of the array should be in increasing order.

The insertion sort algorithm requires a nested pair of loops (one inside the other).

Sorting the data is essential to calculate the median: when in an array that is sorted, the middle (two) values are those contained in the middle (two) indices of the array.

The middle index of an array of n elements, when n is odd, is [(n-1)/2]. The middle two indices, when n is even, are [n/2 - 1] and [n/2].

Be careful when subtracting 1 from an unsigned integer type such as size_t.

Solution

#include #include #include using namespace std; void selectionSort(string [], int); void showArray(string [], int); int main() { const int SIZE = 29; string array[SIZE]; int i=0; string name; ifstream in (\"names.txt\"); if (in.is_open()) { while (! in.eof() ) { getline (in,name); array[i] = name; cout << array[i] << endl; i++; } cout<<\"\ \"; in.close(); } cout << \"\\tThe unsorted string is: \ \"; showArray(name, SIZE); selectionSort(name, SIZE); cout << \"\ \\tThe sorted string is: \ \"; showArray(name, SIZE); system(\"pause\"); return 0; } void selectionSort(string name[], int elems) { int startScan, minIndex; string strName; for(startScan = 0; startScan < (elems - 1); startScan++) { minIndex = startScan; strName = name[startScan]; for(int index = startScan + 1; index < elems; index++) { if(name[index] < strName) { strName = name[index]; minIndex = index; } } name[minIndex] = name[startScan]; name[startScan] = strName; } } void showArray(string name[], int elems) { for(int count = 0; count < elems; count++) cout << count << \": \" << name[count] << endl; }