#include <iostream>
#include <fstream>

using namespace std;

void merge(double numbers[], double temp[], int left, int middle, int right) {
    int i, leftSide, numElements, tempPosition;

    leftSide = (middle-1);
    tempPosition = left;
    numElements = (right - left + 1);

    while((left <= leftSide) && (middle <= right)) {
        if(numbers[left] <= numbers[middle]) {
            temp[tempPosition] = numbers[left];
            tempPosition++;
            left++;
        }
        else {
            temp[tempPosition] = numbers[middle];
            tempPosition++;
            middle++;
        }
    }
    
    while(left <= leftSide) {
        temp[tempPosition] = numbers[left];
        left++;
        tempPosition++;
    }

    while(middle <= right) {
        temp[tempPosition] = numbers[middle];
        middle++;
        tempPosition++;
    }

    for(i=0; i<=numElements; i++) {
        numbers[right] = temp[right];
        right--;
    }
    
}

void mergeSort(double numbers[], double temp[], int left, int right) {
    int middle;
    if(right > left) {
        middle = (right + left) / 2;
        mergeSort(numbers, temp, left, middle);
        mergeSort(numbers, temp, (middle+1), right);

        merge(numbers, temp, left, (middle+1), right);
    }
}

int main() {
    fstream testFile;
    double numbers[200];
    int aSpot = 0;

    testFile.open("test.txt", fstream::in);
    if(!testFile) {
        cout << "For whatever reason, the file cannot be opened." << endl;
        return -1;
    }
    while(!testFile.eof()) {
        testFile.operator >>(numbers[aSpot++]);
    }

    double temp[200];

    mergeSort(numbers, temp, 0, aSpot);
    for(int a = 0; a < aSpot; a++)
        cout << numbers[a] << " ";
    return 0;
}