Парадокс

void merge (int *Array, int p, int q, int r)
{
    int i = p - 1, j = q;
 
    int *result = new int[r - p + 1];
 
    int k = 0;
 
    while(i < q && j < r)
        if (Array[i] < Array[j])
            result[k++] = Array[i++];
        else
            result[k++] = Array[j++];
 
    while (i < q)
        result[k++] = Array[i++];
    while (j < r)
        result[k++] = Array[j++];
 
    for (int i = 0, j = p - 1 ; i<r - p + 1; i++, j++)
        Array[j] = result[i];
 
    delete[] result;
}
 
void merge_sort (int *Array, int Start, int End)
{
    if (Start < End)
    {
        int Split = (Start + End)/2;
        merge_sort (Array, Start, Split);
        merge_sort (Array, Split + 1, End);
        merge (Array, Start, Split, End);
    }
}

#include <iostream>
#include <set>
#include <vector>
#include <limits>
#include <queue>
#include <string>
#include <map>
#include <algorithm>
#include "Windows.h"
#include <conio.h>
 
using namespace std;
 
void merge (int *Array, int p, int q, int r)
{
    int i = p - 1, j = q;
 
    int *result = new int[r - p + 1];
 
    int k = 0;
 
    while(i < q && j < r)
        if (Array[i] < Array[j])
            result[k++] = Array[i++];
        else
            result[k++] = Array[j++];
 
    while (i < q)
        result[k++] = Array[i++];
    while (j < r)
        result[k++] = Array[j++];
 
    for (int i = 0, j = p - 1 ; i<r - p + 1; i++, j++)
        Array[j] = result[i];
 
    delete[] result;
}
 
void merge_sort (int *Array, int Start, int End)
{
    if (Start < End)
    {
        int Split = (Start + End)/2;
        merge_sort (Array, Start, Split);
        merge_sort (Array, Split + 1, End);
        merge (Array, Start, Split, End);
    }
} 
 
int main(){            
    freopen("input.txt", "rt", stdin);
    freopen("output.txt", "wt", stdout);
    const int N = 200000;
    int A[N];
 
    int F;
 
    for (int i = N-1; i>= 0; i--)
        A[i] = rand()%100000;
 
    int start = GetTickCount();
 
    merge_sort (A, 1, N);
    
    cout << GetTickCount() - start;
 
    return 0;
}