int p = k + 1;

if (p < len - p) return p;

return len - p;

if (len == 1) return 0;

int maxdiff = abs(arr[0] - arr[1]);

int maxpos = 0;

for (int i = 1; i < len; ++i) {

int diff = abs(arr[i] - arr[(i + 1) % len]);

if (diff > maxdiff) {

maxdiff = diff;

maxpos = i;

} else if (diff == maxdiff) {

// equals

int len1 = RotateMinStep(maxpos,len);

int len2 = RotateMinStep(i, len);

if (len2 < len1) {

maxdiff = diff;

maxpos = i;

}

}

}

return RotateMinStep(maxpos, len);

int arr[] = {4, 5, 6, 1, 2, 3};

int arr1[] = {1, 2, 3, 4, 5, 6};

int arr2[] = {2, 3, 4, 5, 6, 1};

int len = sizeof(arr)/sizeof(arr[0]);

cout<<RotationDistance(arr, len)<<endl; //3

cout<<RotationDistance(arr1, len)<<endl; //0

cout<<RotationDistance(arr2, len)<<endl; //1

return 0;

}