Nodejs Array Search Binary binarySearchbinarySearch(val, from, to)

Here you can find the source of binarySearchbinarySearch(val, from, to)

Method Source Code

Array.prototype.binarySearch = function binarySearch(val, from, to){
    if (from === undefined) {
        from = 0;/*from  ww  w.j a  v a2  s.co  m*/
    }

    if (to === undefined) {
        to = this.length-1;
    }

    var mid = Math.ceil((from+to)/2),
        midVal = this[mid];

    if (midVal === val) {
        return mid

    } else if (midVal > val) {
        return this.binarySearch(val, from, mid-1);

    } else if (midVal < val) {
        return this.binarySearch(val, mid+1, to);
    }
};

Related

  1. binarySearch(val)
    Array.prototype.binarySearch = function(val){
      var min = 0;
      var max = this.length -1;
      var currentIndex;
      var currentElement;
      while (min <= max) {
        currentIndex = Math.floor((min +max) / 2);
        currentElement = this[currentIndex];
        if (currentElement > val) {
    ...
    
  2. binarySearch(val)
    Array.prototype.binarySearch = function(val){
      var keeper = 0;
      var answer = -1;
      function recursive(arr){
        var len = arr.length;
        var start = Math.floor(len / 2);
        var current = arr[start];
        if (current === val){
          answer = start + keeper;
    ...
    
  3. binarySearch(value)
    Array.prototype.binarySearch = function(value) {
        'use strict';
        if(!value){
            return null;
        var left = 0,
            right = this.length-1,
            find = false,
            middle = null;
    ...
    
  4. binarySearch(value)
    Array.prototype.binarySearch = function(value){
        var items = this;
        console.log(items.length);
        var startIndex  = 0;
        var stopIndex = items.length - 1;
        var middle = Math.floor((stopIndex + startIndex)/2);
        while(items[middle] != value && startIndex < stopIndex){
            if (value < items[middle]){
                stopIndex = middle - 1;
    ...
    
  5. binarySearchbinaryIndexOf;
    function binaryIndexOf(searchElement) {
        'use strict';
        var minIndex = 0;
        var maxIndex = this.length - 1;
        var currentIndex = -1;
        var currentElement;
        while (minIndex <= maxIndex) {
            currentIndex = (minIndex + maxIndex) / 2 | 0;
            currentElement = this[currentIndex];
    ...
    
  6. binary_search(val, left, right)
    Array.prototype.binary_search = function(val, left, right) {
        if (typeof left === 'undefined') left = 0;
        if (typeof right === 'undefined') right = this.length - 1;
        if (left > right) return null;
        var mid = (left + right) >> 1;
        if (val == this[mid]) {
            return mid;
        } else if (val > this[mid]) {
            return this.binary_search(val, mid + 1, right);
    ...
    
  7. binarysearch(i)
    Array.prototype.binarysearch = function (i) {
        var l = 0, u = this.length,  m;
        while ( l <= u ) {
            m = ((l+u) >> 1);
            if ( i > this[m].i ) {
                l = m+1;
            } else {
                u = (i == this[m]) ? -2 : m - 1;
        return (u == -2) ? m : -1;
    };
    
  8. bsearch(target)
    Array.prototype.bsearch = function (target) {
      var half = parseInt(this.length / 2);
      if (target === this[half]) {
        return half;
      if (target > this[half]) {
        return half + this.slice(half,this.length).bsearch(target);
      } else {
        return this.slice(0, half).bsearch(target);
    ...