class Solution {public: void swap(int &a,int & b){ int t=a; a=b; b=t; } void sort(vector<int> &a,int low,int high){ int i=low; int j=high; int key=a[low]; if(i>=j) return; while(i!=j){ while(a[j]>=key&...
