How do you perform a binary search in a given array in TypeScript
TypeScript
x
19
function binarySearch(arr: number[], x: number) { let start = 0; let end = arr.length - 1; while (start <= end) { let mid = Math.floor((start + end) / 2); if (arr[mid] === x) { return mid; } else if (arr[mid] < x) { start = mid + 1; } else { end = mid - 1; } } return -1; // not found }🤖 Code Explanation
This code is written in TypeScript and is a function that performs a binary search on an array of numbers. The function takes two parameters, an array of numbers and a number to search for. The function returns the index of the number if it is found in the array, or -1 if it is not found.
More problems solved in TypeScript
How do you perform a binary search in a given array
Write a function to find the greatest common divisor of two numbers
how to check if a string is a palindrome
find the surface area of a pyramid
Find the count for the occurrence of a particular character in a string
create a generic type that capitalizes the keys of its type parameter
create a generic type that capitalizes the property names of its type parameter
extract all the users whose age is greater than 18 and under 59
how to connect to mysql
How do you check if a given string is a palindrome
How do you swap two numbers without using the third variable
How do you check if a string contains only digits
Given string str, How do you find the longest palindromic substring in str
How do you find duplicate characters in a given string
Write a function to sort an array of integers in ascending order
How to check if the given number is a prime number
How do you count the number of vowels and consonants in a given string