#include <iostream> #include <vector> #include<algorithm> using namespace std; int partition(vector<int>& arr,int low,int high) { int pivot=arr[high]; int i = low-1; for(int j=low;j<high;j++){ if(arr[j]<arr[high]){ i++; swap(arr[i],arr[j]); } } swap(arr[i+1],arr[hig...