Merge two subarrays of Time according to greedy criterion

merge_subarrays.cpp

void merge_subarrays(vector<Time> &array, int low, int mid, int high) {
    vector<Time> left;
    left.resize(mid - low);
    
    vector<Time> right;
    right.resize(high - mid);

    for (int i = 0; i < left.size(); i++) {
        left[i] = array[low + i];
    }
    
    for (int i = 0; i < right.size(); i++) {
        right[i] = array[mid + i];
    }
    
    int i = 0, j = 0;
    
    for (int k = low; k < high; k++) {
        if (i == left.size()) {
            array[k] = right[j++];
        } else if (j == right.size()) {
            array[k] = left[i++];
        } else if (greedy_criterion(left[i]) >= greedy_criterion(right[j])) {
            array[k] = left[i++];
        } else {
            array[k] = right[j++];
        }
    }
}