Toomean

/**
 * Classic Binary Search (Model: "The Vise")
 * * Time Complexity: O(log n)
 * Space Complexity: O(1)
 */
export function binarySearch(nums: number[], target: number): number {
  let left = 0;
  let right = nums.length - 1;

  while (left <= right) {

Toomean

function binarySearch( array, item ) {
  let low =  0;
  let high = array.length - 1;
  
  while ( low <= high ) {
    let mid = Math.floor( ( low + high ) / 2 );
    let guess = array[ mid ];
    
    if ( guess > item ) {
      high = mid - 1; 

Toomean

.visually-hidden {
	position: absolute !important;
	clip: rect(1px 1px 1px 1px); /* IE6, IE7 */
	clip: rect(1px, 1px, 1px, 1px);
	padding:0 !important;
	border:0 !important;
	height: 1px !important; 
	width: 1px !important; 
	overflow: hidden;
}