Binary Search in Typescript

search-generic.ts

function binarySearch<T>(arr: T[], entry: T, compare: (l: T, r: T) => number): number {
	let mid: number = 0,
		l: number = 0,
		r: number = arr.length - 1,
		e: T;

	while (l <= r) {
		mid = Math.floor((l + r) / 2);
		if ((e = arr[mid]!) === entry)
			return mid;
		compare(entry, e) < 0
			? r = mid - 1
			: l = mid + 1;
	}

	return -l-1;
}

search.ts

const binarySearch = (arr: (number | string)[], entry: (number | string)): number => {
	let mid: number = 0,
		l: number = 0,
		r: number = arr.length - 1,
		e: string | number;

	while (l <= r) {
		mid = Math.floor((l + r) / 2);
		if ((e = arr[mid]!) === entry)
			return mid;
		e > entry
			? r = mid - 1
			: l = mid + 1;
	}

	return -l-1;
};