function BinarySearch()
        {
            var array = [3,4,5,6,7,34,54,78,88];
            var min = 0;
            var max = array.length-1;
            var key = 5;
            var mid;
            var index;

            while (min <= max )
            {
                mid = (min + max)/2;
                if (array[mid] == key)
                {
                    index = mid;
                }
                else if (array[mid] < key)
                {
                    min = mid + 1;
                }
                else
                {
                    max = mid - 1;
                }
            }
            jsConsole.writeLine(index);
        }