C++11 CheatSheet - Andrew's Portfolio WEB4.1 Find rank k in array. int find(int l, int r, int k) { int i=0,j=0,x=0,t=0; if (l==r) return a[l]; x=a[(l+r)/2]; t=a[x]; a[x]=a[r]; a[r]=t; i=l-1; for (int j=l; j<=r-1;j++) if (a[j]<=a[r]) { i++ 4.1 Find rank k in array. int find(int l, int r, int k) { int i=0,j=0,x=0,t=0; if (l==r) return a[l]; x=a[(l+r)/2]; t=a[x]; a[x]=a[r]; a[r]=t; i=l-1; for (int j=l; j<=r-1;j++) if (a[j]<=a[r]) { i++; t=a[i]; …