jho406

2.5.0

jho406

2.5.0

jho406

2.5.0

jho406

function binarySearch(search_ary, starting_index, ending_index, value){
  //get the middle index of the search_ary
  // 
  var remaining = ending_index - starting_index;
  var middle_index = starting_index + Math.ceil((remaining)/2);
  // if(remaining == 1 && starting_index == 0){middle_index = starting_index;}
  // debugger;
  //return if the value is found
  if(value === search_ary[middle_index]) return middle_index;

jho406

function BinarySearchTree(value, Walker){
  this.root = new Node(value);
  this.walker = new Walker(this.root);
}

BinarySearchTree.prototype.insert = function(value) {
  var node = new Node(value);
  this.walker.setSubject(node);

  var nextNodeSetter = this.getSetter();

jho406

var DoublyLinkList = function(){
  function init(node){
    this.head = node;
    this.tail = node;
  }
  
  this.append = function(node){
    if (!this.head){
      return init.call(this,node);

jho406

http://minus.com/lvmCcdppXFQie