Quick-find implementation of Princeton Union-Find algorithm on JavaScript

quick-find.js

var items = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];

var id_array = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];

var union = function (p, q) {
  var pId = id_array[p];
  var qId = id_array[q];
  
  if (items[p] === items[q]) {
    return;
  }
  
  for (i = 0; i < items.length; ++i){
    if (id_array[i] === pId){
      id_array[i] = qId;
    }
  }
  
  console.log(id_array);
};

console.log(id_array);