//NOVO------------------------------------------------------------------------
function partition(items, left, right) {
    var pivot   = items[Math.floor((right + left) / 2)], //middle element
        i       = left, //left pointer
        j       = right; //right pointer
    while (i <= j) {
        while (items[i] < pivot) {
            i++;
        }
        while (items[j] > pivot) {
            j--;
        }
        if (i <= j) {
            swap(items, i, j); //swap two elements
            i++;
            j--;
        }
    }
    return i;
}
//STARo------------------------------------------------------------------------
function partition(items, left, right) {
  let pivot = items[Math.floor((right + left) / 2)], //middle element
    i = left, //left pointer
    j = right; //right pointer

while(i<j){
    while (items[i] < pivot) {
        i++;
      }
      while (items[j] > pivot) {
          console.log(j)
        j--;
      }
      if (i <= j) {
        //    sawpping two elements})

        swap(items, i, j);
        i++;
        j--;
      }
    }

    return i;
}