Auto-generated commit

stdlib-bot · stdlib-bot · commit ee801836febf · 2025-05-07T02:44:37.000Z
diff --git a/CHANGELOG.md b/CHANGELOG.md
@@ -4,7 +4,7 @@
 
 <section class="release" id="unreleased">
 
-## Unreleased (2025-04-25)
+## Unreleased (2025-05-07)
 
 <section class="features">
 
@@ -66,6 +66,7 @@
 
 <details>
 
+-   [`3dd8cb3`](https://github.com/stdlib-js/stdlib/commit/3dd8cb379ea22c4a92d610d146cdd662d3187e27) - **chore:** minor clean-up _(by Philipp Burckhardt)_
 -   [`998cea3`](https://github.com/stdlib-js/stdlib/commit/998cea3de3266730ae7e35905faf5570df1a4b29) - **docs:** fix equality check _(by Athan Reines)_
 -   [`5426105`](https://github.com/stdlib-js/stdlib/commit/5426105c564949702197dd622aab2e81cae79283) - **docs:** use C equality operator _(by Philipp Burckhardt)_
 -   [`5b99ffb`](https://github.com/stdlib-js/stdlib/commit/5b99ffb24c9dec39925e95e3a5992cef9283e4eb) - **docs:** fix text block _(by Athan Reines)_
diff --git a/CONTRIBUTORS b/CONTRIBUTORS
@@ -54,13 +54,15 @@ GK Bishnoi <gkishan1kyt@gmail.com>
 GURU PRASAD SHARMA <168292003+GURUPRASADSHARMA@users.noreply.github.com>
 Gaurav <gaurav70380@gmail.com>
 Gautam sharma <gautamkrishnasharma1@gmail.com>
+Girish Garg <garggirish2020@gmail.com>
 Golden Kumar <103646877+AuenKr@users.noreply.github.com>
 Gunj Joshi <gunjjoshi8372@gmail.com>
 Gururaj Gurram <gururajgurram1512@gmail.com>
 Haroon Rasheed <51189276+haroon26@users.noreply.github.com>
-Harsh <149176984+hrshya@users.noreply.github.com>
+Harsh <harshyadav6078@gmail.com>
 HarshaNP <96897754+GittyHarsha@users.noreply.github.com>
 Harshita Kalani <harshitakalani02@gmail.com>
+Hemang Choudhary <coehemang@gmail.com>
 Hemant M Mehta <92446645+hemantmm@users.noreply.github.com>
 Hridyanshu <124202756+HRIDYANSHU054@users.noreply.github.com>
 Jaimin Godhani <112328542+Jai0401@users.noreply.github.com>
@@ -86,6 +88,7 @@ Kohantika Nath <145763549+kohantikanath@users.noreply.github.com>
 Krishnam Agarwal <83017176+888krishnam@users.noreply.github.com>
 Krishnendu Das <86651039+itskdhere@users.noreply.github.com>
 Kshitij-Dale <152467202+Kshitij-Dale@users.noreply.github.com>
+Lalit Narayan Yadav <162928571+LalitNarayanYadav@users.noreply.github.com>
 Lovelin Dhoni J B <100030865+lovelindhoni@users.noreply.github.com>
 MANI <77221000+Eternity0207@users.noreply.github.com>
 Mahfuza Humayra Mohona <mhmohona@gmail.com>
@@ -190,3 +193,4 @@ pranav-1720 <123018993+pranav-1720@users.noreply.github.com>
 rahulrangers <127782777+rahulrangers@users.noreply.github.com>
 rainn <88160429+AmCodesLame@users.noreply.github.com>
 rei2hu <reimu@reimu.ws>
+zhanggy <geodaoyu@foxmail.com>
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`	`*`