void quicksort(double* array, int first, int last)
{
    int left, right, pivot;
    double temp;

    if(first < last){
        pivot = first;
        left = first;
        right = last;

        while(left < right){
            while(array[left] < array[pivot] && left <= last)
                left++;
            while(array[right] >= array[pivot] && right > first)
                right--;
            if(left < right){
                temp = array[left];
                array[left] = array[right];
                array[right] = temp;
                /*Jędryka tu dodał left++; right--; Zobacz co się stanie jak tak zrobisz*/
            }
        }

        temp = array[pivot];
        array[pivot] = array[right];
        array[right] = temp;
        quicksort(array, first, right - 1);
        quicksort(array, right + 1, last);

    }
}