diff --git a/lib/node_modules/@stdlib/array/fixed-endian-factory/README.md b/lib/node_modules/@stdlib/array/fixed-endian-factory/README.md
index ab659bbc55ba..bd5f08dd0065 100644
--- a/lib/node_modules/@stdlib/array/fixed-endian-factory/README.md
+++ b/lib/node_modules/@stdlib/array/fixed-endian-factory/README.md
@@ -887,6 +887,39 @@ var count = context.count;
 // returns 3
 ```
 
+<a name="method-to-sorted"></a>
+
+#### TypedArrayFE.prototype.toSorted( \[compareFcn] )
+
+Returns a new typed array containing the elements in sorted order.
+
+```javascript
+function compareFcn( a, b ) {
+    if ( a > b ) {
+        return 1;
+    }
+    if ( a < b ) {
+        return -1;
+    }
+    return 0;
+}
+var Float64ArrayFE = fixedEndianFactory( 'float64' );
+var arr = new Float64ArrayFE( 'little-endian', [ 3.0, 1.0, 2.0 ] );
+// returns <Float64ArrayFE>
+
+var out = arr.toSorted( compareFcn );
+// returns <Float64ArrayFE>
+
+var v = out.get( 0 );
+// returns 1.0
+
+v = out.get( 1 );
+// returns 2.0
+
+v = out.get( 2 );
+// returns 3.0
+```
+
 <a name="method-to-string"></a>
 
 #### TypedArrayFE.prototype.toString()
diff --git a/lib/node_modules/@stdlib/array/fixed-endian-factory/benchmark/benchmark.to_sorted.js b/lib/node_modules/@stdlib/array/fixed-endian-factory/benchmark/benchmark.to_sorted.js
new file mode 100644
index 000000000000..e7f0cc77a1bc
--- /dev/null
+++ b/lib/node_modules/@stdlib/array/fixed-endian-factory/benchmark/benchmark.to_sorted.js
@@ -0,0 +1,59 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var bench = require( '@stdlib/bench' );
+var pkg = require( './../package.json' ).name;
+var factory = require( './../lib' );
+
+
+// VARIABLES //
+
+var Float64ArrayFE = factory( 'float64' );
+
+
+// MAIN //
+
+bench( pkg+':toSorted', function benchmark( b ) {
+	var out;
+	var arr;
+	var i;
+
+	arr = new Float64ArrayFE( 'little-endian', [ 1.0, 5.0, 3.0, 2.0, 3.0 ] );
+
+	b.tic();
+	for ( i = 0; i < b.iterations; i++ ) {
+		out = arr.toSorted( compareFcn );
+		if ( typeof out !== 'object' ) {
+			b.fail( 'should return an object' );
+		}
+	}
+	b.toc();
+	if ( !( out instanceof Float64ArrayFE ) ) {
+		b.fail( 'should return a typed array' );
+	}
+	b.pass( 'benchmark finished' );
+	b.end();
+
+	function compareFcn( x, y ) {
+		return x - y;
+	}
+});
diff --git a/lib/node_modules/@stdlib/array/fixed-endian-factory/benchmark/benchmark.to_sorted.length.js b/lib/node_modules/@stdlib/array/fixed-endian-factory/benchmark/benchmark.to_sorted.length.js
new file mode 100644
index 000000000000..fee8ca0822d9
--- /dev/null
+++ b/lib/node_modules/@stdlib/array/fixed-endian-factory/benchmark/benchmark.to_sorted.length.js
@@ -0,0 +1,117 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var bench = require( '@stdlib/bench' );
+var pow = require( '@stdlib/math/base/special/pow' );
+var zeroTo = require( '@stdlib/array/zero-to' );
+var pkg = require( './../package.json' ).name;
+var factory = require( './../lib' );
+
+
+// VARIABLES //
+
+var Float64ArrayFE = factory( 'float64' );
+
+
+// FUNCTIONS //
+
+/**
+* Comparison function.
+*
+* @private
+* @param {number} a - first value for comparison
+* @param {number} b - second value for comparison
+* @returns {number} comparison result
+*/
+function compareFcn( a, b ) {
+	if ( a > b ) {
+		return 1;
+	}
+	if ( a < b ) {
+		return -1;
+	}
+	return 0;
+}
+
+/**
+* Creates a benchmark function.
+*
+* @private
+* @param {PositiveInteger} len - array length
+* @returns {Function} benchmark function
+*/
+function createBenchmark( len ) {
+	var arr = new Float64ArrayFE( 'little-endian', zeroTo( len ) );
+	return benchmark;
+
+	/**
+	* Benchmark function.
+	*
+	* @private
+	* @param {Benchmark} b - benchmark instance
+	*/
+	function benchmark( b ) {
+		var out;
+		var i;
+
+		b.tic();
+		for ( i = 0; i < b.iterations; i++ ) {
+			out = arr.toSorted( compareFcn );
+			if ( typeof out !== 'object' ) {
+				b.fail( 'should return an object' );
+			}
+		}
+		b.toc();
+		if ( !( out instanceof Float64ArrayFE ) ) {
+			b.fail( 'should return a typed array' );
+		}
+		b.pass( 'benchmark finished' );
+		b.end();
+	}
+}
+
+
+// MAIN //
+
+/**
+* Main execution sequence.
+*
+* @private
+*/
+function main() {
+	var len;
+	var min;
+	var max;
+	var f;
+	var i;
+
+	min = 1; // 10^min
+	max = 6; // 10^max
+
+	for ( i = min; i <= max; i++ ) {
+		len = pow( 10, i );
+		f = createBenchmark( len );
+		bench( pkg+':toSorted:len='+len, f );
+	}
+}
+
+main();
diff --git a/lib/node_modules/@stdlib/array/fixed-endian-factory/lib/main.js b/lib/node_modules/@stdlib/array/fixed-endian-factory/lib/main.js
index 079902a6c333..599d59c3df58 100644
--- a/lib/node_modules/@stdlib/array/fixed-endian-factory/lib/main.js
+++ b/lib/node_modules/@stdlib/array/fixed-endian-factory/lib/main.js
@@ -1089,6 +1089,69 @@ function factory( dtype ) { // eslint-disable-line max-lines-per-function, stdli
 		return false;
 	});
 
+	/**
+	* Returns a new typed array containing the elements in sorted order.
+	*
+	* @private
+	* @name toSorted
+	* @memberof TypedArray.prototype
+	* @type {Function}
+	* @param {Function} [compareFcn] - comparison function
+	* @throws {TypeError} `this` must be a typed array
+	* @throws {TypeError} first argument must be a function
+	* @returns {TypedArray} sorted array
+	*/
+	setReadOnly( TypedArray.prototype, 'toSorted', function toSorted( compareFcn ) {
+		var obuf;
+		var buf;
+		var tmp;
+		var len;
+		var out;
+		var i;
+
+		if ( !isTypedArray( this ) ) {
+			throw new TypeError( format( 'invalid invocation. `this` is not %s %s.', CHAR2ARTICLE[ dtype[0] ], CTOR_NAME ) );
+		}
+		if ( arguments.length === 0 ) {
+			compareFcn = defaultCompareFcn;
+		} else if ( !isFunction( compareFcn ) ) {
+			throw new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', compareFcn ) );
+		}
+
+		len = this._length;
+		out = new this.constructor( flag2byteOrder( this._isLE ), len );
+		buf = this._buffer;
+		obuf = out._buffer; // eslint-disable-line no-underscore-dangle
+		tmp = [];
+
+		for ( i = 0; i < len; i++ ) {
+			tmp.push( buf[ GETTER ]( i * BYTES_PER_ELEMENT, this._isLE ) );
+		}
+		tmp.sort( compareFcn );
+
+		for ( i = 0; i < len; i++ ) {
+			obuf[ SETTER ]( i * BYTES_PER_ELEMENT, tmp[ i ], this._isLE );
+		}
+		return out;
+
+		/**
+		* Comparison function.
+		*
+		* @private
+		* @param {number} a - first value for comparison
+		* @param {number} b - second value for comparison
+		* @returns {number} comparison result
+		*/
+		function defaultCompareFcn( a, b ) {
+			if ( a > b ) {
+				return 1;
+			}
+			if ( a < b ) {
+				return -1;
+			}
+			return 0;
+		}
+	});
 	/**
 	* Serializes an array as a string.
 	*
diff --git a/lib/node_modules/@stdlib/array/fixed-endian-factory/test/test.to_sorted.js b/lib/node_modules/@stdlib/array/fixed-endian-factory/test/test.to_sorted.js
new file mode 100644
index 000000000000..7626122b0127
--- /dev/null
+++ b/lib/node_modules/@stdlib/array/fixed-endian-factory/test/test.to_sorted.js
@@ -0,0 +1,195 @@
+/**
+* @license Apache-2.0
+*
+* Copyright (c) 2024 The Stdlib Authors.
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+*    http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+'use strict';
+
+// MODULES //
+
+var tape = require( 'tape' );
+var hasOwnProp = require( '@stdlib/assert/has-own-property' );
+var hasSameValues = require( '@stdlib/array/base/assert/has-same-values' );
+var isFunction = require( '@stdlib/assert/is-function' );
+var factory = require( '@stdlib/array/fixed-endian-factory/lib' );
+
+
+// FUNCTIONS //
+
+/**
+* Comparison function.
+*
+* @private
+* @param {number} a - first value for comparison
+* @param {number} b - second value for comparison
+* @returns {number} comparison result
+*/
+function compareFcn( a, b ) {
+	if ( a > b ) {
+		return 1;
+	}
+	if ( a < b) {
+		return -1;
+	}
+	return 0;
+}
+
+
+// TESTS //
+
+tape( 'main export is a function', function test( t ) {
+	t.ok( true, __filename );
+	t.strictEqual( typeof factory, 'function', 'main export is a function' );
+	t.end();
+});
+
+tape( 'the function returns a function', function test( t ) {
+	var ctor = factory( 'float64' );
+	t.strictEqual( isFunction( ctor ), true, 'returns expected value' );
+	t.end();
+});
+
+tape( 'attached to the prototype of the returned function is an `toSorted` method', function test( t ) {
+	var ctor = factory( 'float64' );
+	t.strictEqual( hasOwnProp( ctor.prototype, 'toSorted' ), true, 'returns expected value' );
+	t.strictEqual( isFunction( ctor.prototype.toSorted ), true, 'returns expected value' );
+	t.end();
+});
+
+tape( 'the method throws an error if invoked with a `this` context which is not a typed array instance', function test( t ) {
+	var values;
+	var ctor;
+	var arr;
+	var i;
+
+	ctor = factory( 'float64' );
+	arr = new ctor( 'little-endian', [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );
+
+	values = [
+		'5',
+		5,
+		NaN,
+		true,
+		false,
+		null,
+		void 0,
+		{},
+		[],
+		function noop() {}
+	];
+	for ( i = 0; i < values.length; i++ ) {
+		t.throws( badValue( values[i] ), TypeError, 'throws an error when provided '+values[i] );
+	}
+	t.end();
+
+	function badValue( value ) {
+		return function badValue() {
+			return arr.toSorted.call( value, compareFcn );
+		};
+	}
+});
+
+tape( 'the method throws an error if provided a first argument which is not a function', function test( t ) {
+	var values;
+	var ctor;
+	var arr;
+	var i;
+
+	ctor = factory( 'float64' );
+	arr = new ctor( 'little-endian', [ 1.0, 2.0, 3.0, 4.0 ] );
+
+	values = [
+		'5',
+		3.14,
+		NaN,
+		true,
+		false,
+		null,
+		void 0,
+		{},
+		[]
+	];
+	for ( i = 0; i < values.length; i++ ) {
+		t.throws( badValue( values[i] ), TypeError, 'throws an error when provided '+values[i] );
+	}
+	t.end();
+
+	function badValue( value ) {
+		return function badValue() {
+			return arr.toSorted( value );
+		};
+	}
+});
+
+tape( 'the method returns an empty array if operating on an empty array', function test( t ) {
+	var ctor;
+	var out;
+	var arr;
+
+	ctor = factory( 'float64' );
+	arr = new ctor( 'little-endian' );
+	out = arr.toSorted( compareFcn );
+
+	t.strictEqual( out.length, 0, 'returns expected value' );
+	t.end();
+});
+
+tape( 'the method returns a new typed array containing elements in ascending order', function test( t ) {
+	var expected;
+	var ctor;
+	var arr;
+	var out;
+
+	ctor = factory( 'float64' );
+	arr = new ctor( 'little-endian', [ 5.0, 4.0, 1.0, 2.0, 3.0 ] );
+	expected = new ctor( 'little-endian', [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );
+	out = arr.toSorted( compareFcn );
+
+	t.strictEqual( out instanceof ctor, true, 'returns expected value' );
+	t.notEqual( out, arr, 'returns a new instance' );
+	t.strictEqual( out.length, expected.length, 'returns expected value' );
+	t.strictEqual( hasSameValues( out, expected ), true, 'returns expected value' );
+	t.end();
+});
+
+tape( 'the method returns a new typed array containing elements in ascending order without passing a comparison function', function test( t ) {
+	var expected;
+	var ctor;
+	var arr;
+	var out;
+
+	ctor = factory( 'float64' );
+	arr = new ctor( 'little-endian', [ 5.0, 4.0, 1.0, 2.0, 3.0 ] );
+	expected = new ctor( 'little-endian', [ 1.0, 2.0, 3.0, 4.0, 5.0 ] );
+	out = arr.toSorted();
+
+	t.strictEqual( out.length, expected.length, 'returns expected value' );
+	t.strictEqual( hasSameValues( out, expected ), true, 'returns expected value' );
+	t.end();
+});
+
+tape( 'the method does not change the array length', function test( t ) {
+	var ctor;
+	var arr;
+	var out;
+
+	ctor = factory( 'float64' );
+	arr = new ctor( 'little-endian', 5 );
+	out = arr.toSorted();
+
+	t.strictEqual( out.length, 5, 'returns expected value' );
+	t.end();
+});