A function that find the minimum number of swaps required to sort an unordered array of unique integers into ascending order

minumumSwaps.js

/**
 * Function to get the minumum swaps required to
 * sort an unordered array of unique integers in
 * ascending order
 *
 * @param Array arr
 * @returns Number
 */

const minimumSwaps = arr => {
  let swaps = 0;

  for (let i = 0; i < Math.max(...arr); i++) {
    while (arr[i] < i + 1) {
      // create temporary store for the value
      let temp = arr[i];
      // swap values
      arr[i] = arr[arr[i] - 1];
      arr[temp - 1] = temp;
      // increment the counter
      swaps++;
    }
  }
  // return number of swaps
  return swaps;
};