function binarySearch(arr, target) {
	let sortArr = arr.sort((a, b) => a - b)

	let left = 0;
	let right = sortArr.length - 1;
	let mid;

	while (left <= right) {
		mid = Math.round((right - left) / 2) + left;
		if (target === sortArr[mid]) {
			return `${sortArr}  ${mid} `
		} else if (target < sortArr[mid]) {
			right = mid - 1;
		} else {
			left = mid + 1;
		}
	}
	return -1
}