binary_search

[Pelikano]

Should be self explaining...

PHP Code:

temp.array = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
binary_search(array, 2); // returns true
binary_search(array, 11); // returns false

function binary_search(array, value) {
  temp.volume = array.size();
  temp.middleElement = int(volume/2);
  temp.start = (array[middleElement] < value?middleElement:0);
  temp.end = (start==0?middleElement+1:volume);
  for (i = start; i < end; i++) {
    if (array[i] == value) {
      return true;
    }
  }
  return false;
} 


[DustyPorViva]

if (2 in array) true;
else false;

?

[Pelikano]

Originally Posted by DustyPorViva

if (2 in array) true;
else false;

?

binary_search() is pretty famous.

It's searches a numeric sorted array in an efficient way (usually only used on big arrays).

200'000 Elements -> only searches 100'000.

etc.

[coreys]

Always nice to have around, although I can't think of...well, any use for it, in Graal.
But if the need comes up, then you've got use covered, my boy.

[Twinny]

Admittedly I've never have ever thought of a need for this (my arrays are never ordered) but this is one the first algorithms I was taught =)

Binary Search will save you if you have a gigantic sorted array =D