Hoare Partition Scheme Pivot Selection

Consider the following partition method, which implements Hoare’s partitioning scheme. Which of the following describes a significant performance pitfall of this implementation?

public class Sorter {
    public int partition(int[] data, int low, int high) {
        int pivot = data[low];
        int i = low - 1;
        int j = high + 1;
        while (true) {
            do {
                i++;
            } while (data[i] < pivot);
            do {
                j--;
            } while (data[j] > pivot);
            if (i >= j) return j;
            int temp = data[i];
            data[i] = data[j];
            data[j] = temp;
        }
    }
}