Benchmark: _.sortBy vs _.orderBy vs JS sort

HTML Preparation code:

<script src="https://cdnjs.cloudflare.com/ajax/libs/lodash.js/4.17.21/lodash.min.js" integrity="sha512-WFN04846sdKMIP5LKNphMaWzU7YpMyCU245etK3g/2ARYbPK9Ub18eG+ljU96qKRCWh+quCY7yefSmlkQw1ANQ==" crossorigin="anonymous" referrerpolicy="no-referrer"></script>

Script Preparation code:

var arr = [];
for (var i = 0; i < 1_000_000; i++) {
  arr.push({ value: Math.random() });
}

Tests:

Native JS sort
arr.sort((a, b) => a.value - b.value);
lodash sortby
_.sortBy(arr, (arr) => arr.value);
lodash orderBy
_.orderBy(arr, (arr) => arr.value);

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Native JS sort
lodash sortby
lodash orderBy

Fastest: N/A

Slowest: N/A

Autogenerated LLM Sumamry (model llama3.2:3b, generated 18 days ago):

LLMs can make mistakes. Check important info.

Let's break down what's being tested in the provided JSON.

**Benchmark Overview**

The benchmark is designed to compare the performance of three sorting algorithms:

1. Native JavaScript `sort()` function
2. Lodash's `_.sortBy()` function
3. Lodash's `_.orderBy()` function

**Options Compared**

The main options being compared are:

* **Native JavaScript `sort()`**: This is a built-in function in JavaScript that sorts an array in ascending order.
* **Lodash's `_.sortBy()`**: This function uses a stable sort algorithm (e.g., Timsort or merge sort) to sort an array based on a custom comparison function. In this case, the comparison function is `(a, b) => a.value - b.value`, which sorts objects by their `value` property.
* **Lodash's `_.orderBy()`**: This function is similar to `_.sortBy()`, but it only returns the first occurrence of each sorted value (i.e., if there are duplicates, only one will be returned). In this case, the comparison function is also `(a, b) => a.value - b.value`.

**Pros and Cons**

Here's a brief summary of the pros and cons of each approach:

* **Native JavaScript `sort()`**:
	+ Pros: Fast, widely supported, and easy to implement.
	+ Cons: Unstable sorting (i.e., may change order for arrays with duplicate values), and can be slow for very large datasets.
* **Lodash's `_.sortBy()`**: 
	+ Pros: Stable sorting, efficient implementation, and can handle large datasets.
	+ Cons: Requires the Lodash library to be included, and its performance may vary depending on the specific sorting algorithm used.
* **Lodash's `_.orderBy()`**:
	+ Pros: Similar benefits to `_.sortBy()`, with an added benefit of returning only unique values.
	+ Cons: Same drawbacks as `_.sortBy()`, plus it may return fewer results than expected if there are duplicates.

**Library and Syntax**

The Lodash library is used in this benchmark, specifically the `lodash.min.js` file. The `_.sortBy()` and `_.orderBy()` functions are part of Lodash's utility belt, providing various functional programming helpers.

No special JavaScript features or syntax are being tested in this benchmark, as it only uses standard JavaScript syntax for the sorting algorithms.

**Other Alternatives**

If you're interested in exploring alternative sorting algorithms, here are a few options:

* **Quicksort**: A fast and efficient sorting algorithm that's suitable for large datasets.
* **Merge sort**: A stable sorting algorithm that's well-suited for large datasets with many duplicate values.
* **Radix sort**: A non-comparative sorting algorithm that's optimized for sorting integers or strings.

Keep in mind that the choice of sorting algorithm ultimately depends on your specific use case, dataset size, and performance requirements.

Latest run results:

Run details: (Test run date: yesterday)

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/605.1.15 (KHTML, like Gecko) Version/18.0.1 Safari/605.1.15

Browser/OS: Safari 18 on Mac OS X 10.15.7

View result in a separate tab

Test name	Executions per second
Native JS sort	34.5 Ops/sec
lodash sortby	11.8 Ops/sec
lodash orderBy	11.5 Ops/sec

Related benchmarks:

_.sortBy vs _.orderBy vs JS sort (version: 0)

Comparing performance of: Native JS sort vs lodash sortby vs lodash orderBy

Created: 3 years ago by: Guest

Jump to the latest result

Native JS sort

lodash sortby

lodash orderBy

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A

Autogenerated LLM Sumamry (model llama3.2:3b, generated 18 days ago):