// pgm40
// 12/12/16
// Sample Final Spring 2016 Part III 25pts

#include <iostream>
#include <iomanip>
using namespace std;

// prototypes
void readin(int[], int&);
int changeNeg(int[], int, int);
void printArr(int[], int);
void sortIt(int[], int); // bubble sort
void sortIt2(int[], int); // selection sort

const int SIZE=50;

int main() {

    int numbs[SIZE], n=0, newval=5, counter=0;
    readin(numbs, n);
    cout << "Read in " << n << " data values. " << endl;
    printArr(numbs, n);
    counter = changeNeg(numbs, n, newval);
    cout << "Number of changed values is: " << counter << endl;
    printArr(numbs, n);

    sortIt2(numbs, n);
    cout << "Here is the sorted array: " << endl;
    printArr(numbs, n);
    return 0;
}

// read in accepts 2 parameters, an array, and a reference
// to an int -- which is number of values read in.
// reads in values from the keyboard until there are no
// more. Values go into the array parameter. No more than
// SIZE values are read in.
// ^Z or ^D are used as EOF symbols.

void readin(int vals[], int &lim)
{
    lim=0;
    cout << "Enter a number, EOF to finish: ";
    cin>>vals[lim];
    while (lim<SIZE && cin) {
        lim++;
        cout << "Enter a number, EOF to finish: ";
        cin>>vals[lim];
    }
}

// add somenum to negative numbers in the array
// and return number of changes
int changeNeg(int arr[], int n, int somenum)
{
    int cnt=0;
    for (int i=0; i<n; i++)
       if (arr[i]<0) {
          arr[i]+=somenum;
          cnt++;
       }

    return cnt;
}

void printArr(int arr[], int n)
{
    for (int i=0; i<n; i++)
        cout << arr[i] << ' ';
    cout << endl;
}

// sort first n values in array using bubble sort
void sortIt(int vals[], int n)
{
    int temp, pass=0;
    bool swapped;
    do {
        swapped=false;
        pass++;
        for (int i=0; i<n-pass; i++)
        if (vals[i] < vals[i+1]) {
            //swap
            temp = vals[i];
            vals[i] = vals[i+1];
            vals[i+1]=temp;
            swapped = true;
        }
    } while (swapped);
    return;
}
// uses selection sort to sort the array
void sortIt2(int vals[], int n)
{
    int i,j, temp;
    for (i=0; i<n-1; i++)
        for (j=i+1; j<n; j++)
            if (vals[j]>vals[i]) {
                // swap
                temp=vals[i];
                vals[i]=vals[j];
                vals[j]=temp;
    }
}