Auto-generated commit

stdlib-bot · stdlib-bot · commit b8b6fa7e767a · 2025-05-07T02:44:03.000Z
diff --git a/CHANGELOG.md b/CHANGELOG.md
@@ -4,7 +4,7 @@
 
 <section class="release" id="unreleased">
 
-## Unreleased (2025-05-06)
+## Unreleased (2025-05-07)
 
 <section class="features">
 
@@ -36,6 +36,7 @@
 
 <details>
 
+-   [`3dd8cb3`](https://github.com/stdlib-js/stdlib/commit/3dd8cb379ea22c4a92d610d146cdd662d3187e27) - **chore:** minor clean-up _(by Philipp Burckhardt)_
 -   [`5fcde08`](https://github.com/stdlib-js/stdlib/commit/5fcde08f9cce69278aa50f7aff8c17d5222df0af) - **style:** disable lint rule _(by Athan Reines)_
 -   [`aa86262`](https://github.com/stdlib-js/stdlib/commit/aa862629c2826d5f0b9e69c64264eea89ea1de7d) - **fix:** use computed order _(by Athan Reines)_
 -   [`2d63924`](https://github.com/stdlib-js/stdlib/commit/2d63924aea1ea500037ca025d8d405018907c8dd) - **docs:** update comment _(by Athan Reines)_
diff --git a/src/internal/sort2ins.c b/src/internal/sort2ins.c
@@ -26,7 +26,7 @@
 *
 * -   The first array is sorted in increasing order according to absolute value.
 * -   The algorithm has space complexity `O(1)` and worst case time complexity `O(N^2)`.
-* -   The algorithm is efficient for small arrays (typically `N <= 20``) and is particularly efficient for sorting arrays which are already substantially sorted.
+* -   The algorithm is efficient for small arrays (typically `N <= 20`) and is particularly efficient for sorting arrays which are already substantially sorted.
 * -   The algorithm is **stable**, meaning that the algorithm does **not** change the order of array elements which are equal or equivalent.
 * -   The input arrays are sorted in-place (i.e., the input arrays are mutated).
 *

Original file line number	Diff line number	Diff line change
`@@ -26,7 +26,7 @@`
`26`	`26`	`*`
`27`	`27`	`* - The first array is sorted in increasing order according to absolute value.`
`28`	`28`	* - The algorithm has space complexity `O(1)` and worst case time complexity `O(N^2)`.
`29`		-* - The algorithm is efficient for small arrays (typically `N <= 20``) and is particularly efficient for sorting arrays which are already substantially sorted.
	`29`	+* - The algorithm is efficient for small arrays (typically `N <= 20`) and is particularly efficient for sorting arrays which are already substantially sorted.
`30`	`30`	`* - The algorithm is stable, meaning that the algorithm does not change the order of array elements which are equal or equivalent.`
`31`	`31`	`* - The input arrays are sorted in-place (i.e., the input arrays are mutated).`
`32`	`32`	`*`