public static void quicksort(int pole[], int start, int konec) 
	{
        int s = start;
        int k = konec;
        
        if (konec - start >= 1) 
        {
        
            int pivot = pole[start];
            
            while(k > s) 
            {
                
                while(pole[s] <= pivot && s <= konec && k > s)
                {
                	por++;
                    s++;
                }
                while(pole[k] > pivot && k >= start && k >= s)
                {
                	por++;
                    k--;
                }
                if(s < k)
                {
                    nahrada(pole, s, k);
                }
            }
            nahrada(pole, k, start);
            quicksort(pole, start, k - 1);
            quicksort(pole, ++k, konec);
        }
        else 
        {
            return;
        }
    }