Info

Looks at the performance difference between brute force searching and binary search

Preparation code

<script>
  for (var i = 0, searchArr = []; i < 2000; i++) {
   searchArr[i] = i;
  }
  
  var count = 0,
      curVal = 0;
</script>

Test runner

Warning! For accurate results, please disable Firebug before running the tests. (Why?)

Java applet disabled.

var num = Math.random() * 2000;

for (var i = 0; i < 2000; i++) {
 curVal = searchArr[i];
 if (curVal === num) {
  break;
 }
}

var num = Math.random() * 2000;

while (num !== curVal) {
 curVal = searchArr[Math.round(searchArr.length / 2)];
 if (searchArr.length > 1) {
  if (curVal > num) {
   searchArr = searchArr.splice(0, searchArr.length / 2);
  } else if (curVal < num) {
   searchArr = searchArr.splice(Math.round(searchArr.length / 2), Math.round(searchArr.length / 2));
  }
 } else {
  curval = searchArr[0];
  break;
 }
}

Compare results of other browsers

Revisions

You can edit these tests or add even more tests to this page by appending /edit to the URL. Here’s a list of current revisions for this page:

• Revision 1: published by Jason on 11th May 2011
• Revision 2: published by Mike on 15th May 2011
• Revision 12: published on 19th March 2012
• Revision 16: published on 29th March 2012

1 comment