void modyfiedQuickSort(int arr[], int l, int h, int order, int* compares, int* swaps) {
        if(h - l < 16){
            insertionSort(&arr[l], h-l+1, order, compares, swaps);
        } else if (l < h) {
                int p = modyfiedPartition(arr, l, h, order, compares, swaps);

                modyfiedQuickSort(arr, l, p - 1, order, compares, swaps);
                modyfiedQuickSort(arr, p + 1, h, order, compares, swaps);
        }
}