Benchmark: Already sorted versus random

Script Preparation code:

function shuffle(array) {
  var currentIndex = array.length, temporaryValue, randomIndex;

  // While there remain elements to shuffle...
  while (0 !== currentIndex) {

    // Pick a remaining element...
    randomIndex = Math.floor(Math.random() * currentIndex);
    currentIndex -= 1;

    // And swap it with the current element.
    temporaryValue = array[currentIndex];
    array[currentIndex] = array[randomIndex];
    array[randomIndex] = temporaryValue;
  }

  return array;
}

var sorted = [];
var shuffled = [];
for (var i = 0; i < 1000; i++) {
  sorted.push('a' + i);
  shuffled.push('a' + i);
}

shuffled = shuffle(shuffled);

Tests:

Sort the sorted
var s2 = sorted.sort();
Sort the shuffled
var s2 = shuffled.sort();

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Sort the sorted
Sort the shuffled

Fastest: N/A

Slowest: N/A

ⓘ Get performance results from real users on your website with Request Metrics.

Website Performance Monitoring by Request Metrics

Latest run results:

Run details: (Test run date: 7 years ago)

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_10_5) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/53.0.2785.116 Safari/537.36

Browser/OS: Chrome 53 on Mac OS X 10.10.5

View result in a separate tab

Test name	Executions per second
Sort the sorted	3066.3 Ops/sec
Sort the shuffled	2980.2 Ops/sec

Already sorted versus random (version: 1)

Check how much an array sort is faster on an already sorted array or on a randomized one

Comparing performance of: Sort the sorted vs Sort the shuffled

Created: 7 years ago by: Registered User

Jump to the latest result

Sort the sorted

Sort the shuffled

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A