Minimum Number of Operations to Reinitialize a Permutation LeetCode solution in JavaScript

1
var reinitializePermutation = function (n) {
2
  const BASE_INDEX = 1;
3
  let result = 1;
4
  let index = n / 2 + (BASE_INDEX - 1) / 2;
5

6
  while (index !== BASE_INDEX) {
7
    index = index % 2 ? n / 2 + (index - 1) / 2 : index / 2;
8
    result += 1;
9
  }
10
  return result;
11
};