Hoare and Lomuto Algorithms

HoareLomuto.java

int partitionLomuto(int[] A) {
    int l = 0, r = A.length - 1;
    int p = A[r];
    int ll = l - 1;

    for (int bu = l; bu < r; bu++) {
        if (A[bu] <= p) {
            ll++;
            swap(A, ll, bu);
        }
    }
    swap(A, ll + 1, r);
        
    return ll;
}

int partitionHoare(int[] A) {
    int p = A[A.length - 1];
    int l = -1, r = A.length;

    while (true) {
        do l++; while (A[l] < p);
        do r--; while (A[r] > p);
        if (l >= r)
            break;
        swap(A, l, r);
    }

    return l;
}