How to use binary search in js

This article will explain in detail how to use binary search in js. The editor thinks it is very practical, so I share it for you as a reference. I hope you can get something after reading this article.

1. The premise of binary search is that the array is ordered, starting with the middle elements of the array. If the intermediate element happens to be the target value, the search is over.

2. If the target value is greater or less than the intermediate element, search in half of the greater or less intermediate element.

Example

Array.prototype.binarySearch = function (item) {let low = 0; let high = this.length-1; while (low item) {high = mid-1;} else {return mid;}} return-1;}; const arr = [1,2,3,4,5]; const res = arr.binarySearch (3) This is the end of the article on "how to use binary search in js". I hope the above content can be of some help to you, so that you can learn more knowledge. if you think the article is good, please share it for more people to see.