Binary Search in JavaScript

index.js

function binarySearch(sortedArry, itemToFind)
{
  var minIndex = 0;
  var maxIndex = sortedArry.length - 1; 
  
  while (minIndex <= maxIndex)
  {
    var midIndex = Math.floor((minIndex + maxIndex) / 2);
    
    if(sortedArry[midIndex] == itemToFind)
    {
      return midIndex;
    }
    else if (sortedArry[midIndex] < itemToFind)
    {
      minIndex = midIndex + 1; 
    } else {
      maxIndex = midIndex - 1; 
    }
  }
  return null; 
}

var arry = ["blue", "green", "indigo", "orange", "red", "violet", "yellow"];
var sortedArry = arry.sort();
console.log(binarySearch(sortedArry, "yellow"));