循环右移数组

void Reverse(int R[], int from,int to) {
  int temp;
  for (int i = 0; i <= (from+to)/2-from; i++)
  {
    temp = R[i+from];
    R[i+from] = R[to-i];
    R[to-i] = temp;
  }
}
bool Converse(int R[], int n, int p)
{
  p = p % n;
  if (p<=0)
  {
    return false;
  }
  Reverse(a, 0, n-p-1);
  Reverse(a, n-p, n - 1);
  Reverse(a, 0, n - 1);
  return true;
}