快速排序的递归方法中的错误

Question

The results of sorting before and after are identical. Perhaps the error lies in the recursion. is it possible to shorten the writing of a recursive case for quick sorting? Where is the error? (The recursive case takes up an insanely large amount of space, I understand that optimization and code purity are terrible) love everyone)

import java.util.Random;
import java.util.Arrays;

public class Main {
    //array creation
    public static void main(String[] args) {
        Random rand = new Random();
        int[] numbers = new int[100];
       //filling an array with random values
        for (int i = 0; i < numbers.length;i++) {
            numbers[i] = rand.nextInt(100);   
        }
        //the array display method before sorting
        System.out.println("Before:");
         String num = Arrays.toString(numbers);
        System.out.print(num);
        //calling 
        quicksort(numbers, 0, numbers.length - 1);
        //the sorting result
        System.out.println("\nAfter:");
        System.out.print(num);
    }
    //quicksort
    private static void quicksort(int[] numbers, int lowIndex, int highIndex) {
        
        if(lowIndex >= highIndex) {
            return;
        }
        
        int pivot = numbers[highIndex];
        
        int leftPointer = lowIndex;
        int rightPointer = highIndex;
        
        while(leftPointer < rightPointer) {
            
            while ( numbers[leftPointer] <= pivot && leftPointer < rightPointer) {
                leftPointer++;
            }
            
            while(numbers[rightPointer] >= pivot && leftPointer < rightPointer) {
                rightPointer--;
            }
            
            swap(numbers, leftPointer, rightPointer);
        }
        swap(numbers, leftPointer, highIndex);
        
        quicksort(numbers, lowIndex, leftPointer - 1);
        quicksort(numbers,leftPointer + 1, highIndex);
    }
    //replacing the reference element
    private static void swap(int[] numbers, int index1, int index2) {
        int temp = numbers[index1];
        numbers[index1] = numbers[index2];
        numbers[index2] = temp;
    }
}