Benchmark: Array Shuffling - MeasureThat.net

Script Preparation code:

var array = ['kruze', 'medspoke', 'pickfood','listNride', 'herokey']

function shuffleArray (array) {
  for (let i = array.length - 1; i > 0; i--) {
    const j = Math.floor(Math.random() * (i + 1))
    const temp = array[i]
    array[i] = array[j]
    array[j] = temp
  }
  return array
}

Tests:

sort randomly
array.sort(() => Math.random() - Math.random())
shuffle func
shuffleArray(array);

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
sort randomly
shuffle func

Fastest: N/A

Slowest: N/A

Latest run results:

Run details: (Test run date: one year ago)

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:132.0) Gecko/20100101 Firefox/132.0

Browser/OS: Firefox 132 on Windows

View result in a separate tab

shuffle func

10.6M/s

sort randomly

4.7M/s

View exact numbers

Test name	Executions per second
✓ shuffle func	10,567,633 Ops/sec
sort randomly	4,734,546 Ops/sec

Autogenerated LLM Summary (model llama3.2:3b, generated one year ago):

LLMs can make mistakes. Check important info.

Let's break down the provided JSON and explain what's being tested, compared, and their pros/cons.

**Benchmark Definition**

The benchmark definition is an object that describes the test case. In this case, there are two definitions:

1. `array.sort(() => Math.random() - Math.random())`
2. `shuffleArray(array);`

Let's analyze each one:

* **1. `array.sort(() => Math.random() - Math.random())`**:
	+ This is a JavaScript function that sorts an array using the built-in `sort()` method with a custom comparison function.
	+ The comparison function generates two random numbers (`Math.random()`), subtracts them, and returns the result.
	+ This test case measures the performance of the sorting algorithm when it's used with a randomly generated comparison function.
* **2. `shuffleArray(array);`**:
	+ This is a custom function that shuffles an array using a Fisher-Yates shuffle algorithm.
	+ The purpose of this test case is to measure the performance of the shuffle function.

**Options Compared**

In both test cases, the same input data (`array`) is used. However, the comparison functions differ:

1. **Built-in `sort()` method**: This option uses the built-in sorting algorithm provided by JavaScript.
2. **Custom shuffle function`: This option uses a custom implementation of the Fisher-Yates shuffle algorithm.

**Pros/Cons**

Here are some pros and cons of each approach:

* **Built-in `sort()` method**:
	+ Pros: Fast, widely supported, and well-optimized.
	+ Cons: May not be as efficient for large arrays or specific use cases (e.g., when the comparison function is complex).
* **Custom shuffle function**:
	+ Pros: Can provide more control over the shuffling algorithm, which might be beneficial in certain situations.
	+ Cons: May be slower than the built-in sorting algorithm, and its implementation needs to be optimized for performance.

**Library Usage**

There is no explicit library usage mentioned in the benchmark definitions. However, it's worth noting that some JavaScript environments or browsers might provide additional libraries or optimizations for array operations.

**Special JS Features/Syntax**

There are no special JavaScript features or syntax used in these test cases. The focus is on measuring the performance of the sorting algorithm and shuffle function.

**Other Alternatives**

If you wanted to create similar benchmarks, here are some alternative approaches:

1. Use a different sorting algorithm (e.g., quicksort, mergesort).
2. Measure the performance of other array operations (e.g., `Array.prototype.forEach()`, `Array.prototype.map()`).
3. Compare different implementations of the Fisher-Yates shuffle algorithm.
4. Test the performance of these algorithms on different input sizes or distributions.

Keep in mind that the specific choice of benchmark and test cases depends on your goals, requirements, and target audience.

Array Shuffling (version: 0) Benchmark.js

Comparing performance of: `sort randomly vs shuffle func`

Created: 5 years ago by: Guest

Go to the latest result

sort randomly

shuffle func

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

Autogenerated LLM Summary (model llama3.2:3b, generated one year ago):

Array Shuffling (version: 0) Benchmark.js

Comparing performance of: sort randomly vs shuffle func

Created: 5 years ago by: Guest

Go to the latest result

sort randomly

shuffle func

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

Autogenerated LLM Summary (model llama3.2:3b, generated one year ago):

Comparing performance of: `sort randomly vs shuffle func`