#include <iostream>
#include <fstream>
#include <iomanip>
using namespace std;
int fill_array(int data[], ifstream& file, int big);
void sort_array(int data[], int size);
int find_most(int data[], int size);
int main()
{
    const int MAX = 25;
    ifstream in_file;
    int numbers[MAX];
    int num = 0, most = 0;
    in_file.open("C:\\Users\\Rohit\\Documents\\Visual Studio 2010\\Projects\\HW7_Reddy\\HW7_Reddy\\numbers.txt");
    if(in_file.fail())
    {
        cout << "I'm sorry, I could not open the input file\n";
        exit(1);
    }
    while((in_file >> numbers[num]) &&
        (num < MAX))
    {
        num++;
    }
    num = fill_array(numbers, in_file, most);
    sort_array(numbers, MAX);
    most = find_most(numbers, MAX);
    cout << "The sorted values: \n";
    for(int i=0; i<num; i++)
    {
        cout << numbers[i] << endl;
    }
    cout << "There are " << num << " values in the array." << endl;
    cout << "The most frequent value is: " << most << endl;
    in_file.close();
    return 0;
}

int fill_array(int data[], ifstream& file, int big)
{
    int num = 0;
    while (!file.eof() && num < big)
    {
        file >> data[num];
        num++;
    }
    return num;
}

void sort_array(int data[], int size)
{
    int smallest, hold;
    for(int k = 0; k <= size - 2; k++)
    {
        smallest = k;

        for(int j=k+1; j<=size-1;j++)
        {
            if(data[j]<data[smallest])
            {
                smallest = j;
            }
            hold = data[smallest];
            data[smallest] = data[k];
            data[k] = hold;
        }
    }
    return;
}
int find_most(int data[], int size)
{
    int count, oldcount = 0, most = 0, mode, x, y;
    for(x=0; x<size; x++)
    {
        mode = data[x];
        count = 1;
    }
    for(y = x+1; y < size;y++)
    {
        if(mode==data[y]) count++;
    }
    if(count > oldcount)
    {
      most = mode;
      oldcount = count;
    }
  return most;
 }