首页 > 代码库 > [Algorithms] Binary Search Algorithm using TypeScript
[Algorithms] Binary Search Algorithm using TypeScript
(binary search trees) which form the basis of modern databases and immutable data structures. Binary search works very much the way humans intuitively search for a name in a yellow pages directory (if you have ever seen one) or the dictionary.
In this lesson we learn how to implement a Binary Search Algorithm using TypeScript / Javascript, and we describe the problem that it solves.
function binarySearch( array: number[], element: number, start: number = 0, end: number= array.length -1): number { if(end < start) { return -1; } const middle = Math.floor((start + end) / 2); return element === array[middle] ? middle : element < array[middle] ? binarySearch(array, element, start, middle - 1) : binarySearch(array, element, middle + 1, end);}const unsortedArray = [ 6, 7, 8, 9, 10, 1, 2, 3, 4, 5]console.log("Index of 4: ", binarySearch(unsortedArray.sort(), 4))console.log("22 not found: ", binarySearch(unsortedArray.sort(), 22))
[Algorithms] Binary Search Algorithm using TypeScript
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。