You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: CHANGELOG.md
+2-1Lines changed: 2 additions & 1 deletion
Original file line number
Diff line number
Diff line change
@@ -4,14 +4,15 @@
4
4
5
5
<sectionclass="release"id="unreleased">
6
6
7
-
## Unreleased (2025-03-24)
7
+
## Unreleased (2025-05-07)
8
8
9
9
<sectionclass="commits">
10
10
11
11
### Commits
12
12
13
13
<details>
14
14
15
+
-[`3dd8cb3`](https://github.com/stdlib-js/stdlib/commit/3dd8cb379ea22c4a92d610d146cdd662d3187e27) - **chore:** minor clean-up _(by Philipp Burckhardt)_
Copy file name to clipboardExpand all lines: src/internal/sort2ins.c
+1-1Lines changed: 1 addition & 1 deletion
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).
0 commit comments