Info

The actual use-case isn't to sort for every insertion. Either you keep a sorted array, or you sort it at the end.

I use linear search as a baseline.

Preparation code

<script>
function findBSearch(n, array) {
  var low = 0, high = array.length;
  while (low < high) {
    var mid = (low + high) >>> 1;
    array[mid] < n ? low = mid + 1 : high = mid;
  }
  return low;
};
function findIndexOf(el, arr) {
  for (var i = 0; arr[i] < el; i++) {}
  return i;
}
</script>
<script>
  Benchmark.prototype.setup = function() {
    // Pseudo-random data.
    // I keep it the same for the sake of comparison.
 
  };
</script>

Test runner

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

Java applet disabled.

var arr = [];
for (var i = 0; i < input.length; i++) {
  arr.push(input[i]);
}
arr.sort(function(a,b){return a-b;});

var arr = [];
var pos;
for (var i = 0; i < input.length; i++) {
  pos = findIndexOf(input[i], arr);
  arr.splice(pos, 0, input[i]);
}

var arr = [];
var pos;
for (var i = 0; i < input.length; i++) {
  pos = findBSearch(input[i], arr);
  arr.splice(pos, 0, input[i]);
}

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 on 1st July 2011
• Revision 2: published on 15th September 2012 and last updated on 16th September 2012
• Revision 3: published on 6th January 2013
• Revision 4: published by espadrine on 21st January 2013
• Revision 5: published on 5th February 2013
• Revision 6: published on 5th February 2013
• Revision 7: published on 5th February 2013
• Revision 8: published on 22nd March 2013
• Revision 9: published 3 weeks ago

0 comments