YusufAbdelaziz

import java.util.Arrays;

public class problemSolving {

    static void quickSort(int[] array, int l, int r) {
        //We first check if the left-most element index is greater than right-most element index

        //This is considered as a base case to exit from infinite recursive calls
        if (l >= r) {
            return;