walking

#include using namespace std; void merge(int *intArray,int p,int q,int r) { int n1 = q-p+1; int n2 = r-q; int *a1 = new int[n1]; int *a2 = new int[n2]; for(int i=0;i<n1;i++) { a1[i] = intArr

#include using namespace std; void maxMin(int* arr,int p,int r,int &min,int &max) { if(p<r) { int q = (p+r)/2; int lmin,lmax,rmin,rmax; maxMin(arr,p,q,lmin,lmax); maxMin(arr,q+1,r,rmin,rmax

#include using namespace std; void second(int *arr,int p,int r,int &fst,int &sec) { if(p<r) { int q = (p+r)/2; int lfst,lsec,rfst,rsec; second(arr,p,q,lfst,lsec); second(arr,q+1,r,rfst,rsec)