@@ -6,6 +6,10 @@
 
 -   Raise the minimum required Node.js version to `>=22.13.0`, for stable `require(esm)` support ([#84313](https://github.com/WordPress/gutenberg/pull/84313)).
 
+### Internal
+
+-   Use the standard `Array.prototype.toSorted()` method instead of copying an array before sorting ([#52213](https://github.com/WordPress/gutenberg/pull/52213)).
+
 ## 6.57.0 (2026-10-07)
 
 ## 6.56.0 (2026-09-23)
 
@@ -190,7 +190,7 @@ function isSameTranslation( a, b ) {
  * @return {Array} Sorted translations.
  */
 function sortByReference( translations = [] ) {
-	return [ ...translations ].sort( ( a, b ) =>
+	return translations.toSorted( ( a, b ) =>
 		a.comments.reference.localeCompare( b.comments.reference )
 	);
 }
 
@@ -45,7 +45,7 @@ const comparator = < T extends SortItem >(
 			return order === 'asc' ? -1 : 1;
 		}
 
-		// `Array.prototype.sort` is stable, so ties keep their original order.
+		// `Array.prototype.toSorted` is stable, so ties keep their original order.
 		return 0;
 	};
 };
@@ -66,5 +66,5 @@ export function orderBy< T extends SortItem >(
 	field: SortField< T >,
 	order = 'asc'
 ) {
-	return items.concat().sort( comparator( field, order ) );
+	return items.toSorted( comparator( field, order ) );
 }
@@ -97,7 +97,7 @@ export function sortImageBlocks( blocks, media, { orderby, order } ) {
 		] )
 	);
 
-	return [ ...blocks ].sort( ( a, b ) => {
+	return blocks.toSorted( ( a, b ) => {
 		const keyA = keys.get( a );
 		const keyB = keys.get( b );
 		if ( keyA === undefined || keyB === undefined ) {
 
@@ -34,7 +34,7 @@ function mapMenuItemsToBlocks( menuItems, level = 0 ) {
 	let mapping = {};
 
 	// The menuItem should be in menu_order sort order.
-	const sortedItems = [ ...menuItems ].sort(
+	const sortedItems = menuItems.toSorted(
 		( a, b ) => a.menu_order - b.menu_order
 	);
 
 
@@ -323,7 +323,7 @@ const PlaylistEdit = ( {
 
 	const onChangeOrder = useCallback(
 		( trackOrder ) => {
-			const sortedBlocks = [ ...innerBlockTracks ].sort( ( a, b ) => {
+			const sortedBlocks = innerBlockTracks.toSorted( ( a, b ) => {
 				const titleA = a.attributes.title || '';
 				const titleB = b.attributes.title || '';
 
 
@@ -1,5 +1,5 @@
 import { v4 as uuid } from 'uuid';
-import { createHooks, applyFilters } from '@wordpress/hooks';
+import { applyFilters } from '@wordpress/hooks';
 import deprecated from '@wordpress/deprecated';
 import warning from '@wordpress/warning';
 import {
@@ -460,24 +460,12 @@ export function findTransform< T extends BlockTransform >(
 	transforms: T[],
 	predicate: ( transform: T ) => boolean
 ): T | null {
-	// The hooks library already has built-in mechanisms for managing priority
-	// queue, so leverage via locally-defined instance.
-	const hooks = createHooks();
-
-	for ( let i = 0; i < transforms.length; i++ ) {
-		const candidate = transforms[ i ];
-		if ( predicate( candidate ) ) {
-			hooks.addFilter(
-				'transform',
-				'transform/' + i.toString(),
-				( result ) => ( result ? result : candidate ),
-				candidate.priority
-			);
-		}
-	}
-
-	// Filter name is arbitrarily chosen but consistent with above aggregation.
-	return hooks.applyFilters( 'transform', null ) as T | null;
+	// `priority` has the same meaning as in WP hooks: lower runs earlier, default is 10.
+	const priority = ( t: T ) => t.priority ?? 10;
+	const candidates = transforms
+		.filter( ( t ) => predicate( t ) )
+		.toSorted( ( t1, t2 ) => priority( t1 ) - priority( t2 ) );
+	return candidates.length > 0 ? candidates[ 0 ] : null;
 }
 
 /**
 
@@ -722,7 +722,7 @@ export function calculateNotePositions( {
 	// sweep's assumption holds and cards never displace past their markers.
 	// Threads without a rect keep their relative order; they are skipped
 	// below and never receive a position.
-	const orderedThreads = [ ...threads ].sort(
+	const orderedThreads = threads.toSorted(
 		( a, b ) =>
 			( blockRects[ a.id ]?.top ?? Number.MAX_VALUE ) -
 			( blockRects[ b.id ]?.top ?? Number.MAX_VALUE )
 
@@ -45,7 +45,7 @@ export function CollaboratorsPresence( {
 
 	// Always include self in the list sorted first.
 	const collaboratorsForList = useMemo( () => {
-		return [ ...activeCollaborators ].sort( ( a, b ) => {
+		return activeCollaborators.toSorted( ( a, b ) => {
 			if ( a.isMe && ! b.isMe ) {
 				return -1;
 			}
 
@@ -121,7 +121,7 @@ export function FlatTermSelector( { slug } ) {
 				...DEFAULT_QUERY,
 				// Sort ids so reordering alone doesn't produce a new query key and re-fetch.
 				include: _termIds?.length
-					? [ ..._termIds ].sort( ( a, b ) => a - b ).join( ',' )
+					? _termIds.toSorted( ( a, b ) => a - b ).join( ',' )
 					: undefined,
 				per_page: -1,
 			};
Original file line number	Diff line number	Diff line change
`@@ -190,7 +190,7 @@ function isSameTranslation( a, b ) {`
`190`	`190`	`* @return {Array} Sorted translations.`
`191`	`191`	`*/`
`192`	`192`	`function sortByReference( translations = [] ) {`
`193`		`- return [ ...translations ].sort( ( a, b ) =>`
	`193`	`+ return translations.toSorted( ( a, b ) =>`
`194`	`194`	`a.comments.reference.localeCompare( b.comments.reference )`
`195`	`195`	`);`
`196`	`196`	`}`
Original file line number	Diff line number	Diff line change
`@@ -45,7 +45,7 @@ const comparator = < T extends SortItem >(`
`45`	`45`	`return order === 'asc' ? -1 : 1;`
`46`	`46`	`}`
`47`	`47`
`48`		- // `Array.prototype.sort` is stable, so ties keep their original order.
	`48`	+ // `Array.prototype.toSorted` is stable, so ties keep their original order.
`49`	`49`	`return 0;`
`50`	`50`	`};`
`51`	`51`	`};`
`@@ -66,5 +66,5 @@ export function orderBy< T extends SortItem >(`
`66`	`66`	`field: SortField< T >,`
`67`	`67`	`order = 'asc'`
`68`	`68`	`) {`
`69`		`- return items.concat().sort( comparator( field, order ) );`
	`69`	`+ return items.toSorted( comparator( field, order ) );`
`70`	`70`	`}`
Original file line number	Diff line number	Diff line change
`@@ -45,7 +45,7 @@ export function CollaboratorsPresence( {`
`45`	`45`
`46`	`46`	`// Always include self in the list sorted first.`
`47`	`47`	`const collaboratorsForList = useMemo( () => {`
`48`		`- return [ ...activeCollaborators ].sort( ( a, b ) => {`
	`48`	`+ return activeCollaborators.toSorted( ( a, b ) => {`
`49`	`49`	`if ( a.isMe && ! b.isMe ) {`
`50`	`50`	`return -1;`
`51`	`51`	`}`