r=partition(A, p,q);quickSort(A,p,r); //range is from A[p] to A[r-1] quickSort(A,(r+1),q); //range is from A[r+1] to A[q-1]#include #include using namespace std;void quickSort(vector&,int,int);int partition(vector&, int,int);int main(){ vector A = {6,10,13,5,8,3,2,25,4,11}; int p=0; int q=10; cout