binary search vs loop (v12)

Revision 12 of this benchmark created on

Description

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

Preparation HTML

<script>
  var arr = new Array();
  for (var i = 0; i < 2000; ++i) {
   arr[i] = i;
  }
</script>

Test runner

Ready to run.

Testing in
TestOps/sec
brute force
var num = Math.floor(Math.random() * arr.length);
var i;

for (i = 0; i < arr.length; i++) {
 if (arr[i] == num) {
  return i;
 }
 else if (arr[i] > num) {
  return null;
 }
}
return null;

 
ready
binary math.floor
var find = Math.floor(Math.random() * arr.length);
var searchArr = arr;
  var low = 0, high = searchArr.length - 1, i, comparison;
  while (low <= high) {
    i = Math.floor((low + high) / 2);
    if (searchArr [i] < find) { low = i + 1; continue; };
    if (searchArr [i] > find) { high = i - 1; continue; };


    return i;
  }

  return null;
ready
binary bitshift
var find = Math.floor(Math.random() * arr.length);
var searchArr = arr;
  var low = 0, high = searchArr.length - 1, i, comparison;
  while (low <= high) {
    i = (low + high) >> 1;
    if (searchArr [i] < find) { low = i + 1; continue; };
    if (searchArr [i] > find) { high = i - 1; continue; };


    return i;
  }

  return null;
ready

Revisions

You can edit these tests or add more tests to this page by appending /edit to the URL.