Auto-generated commit

Author: stdlib-bot

.github/.keepalive

@@ -4,14 +4,15 @@
 
 <section class="release" id="unreleased">
 
-## Unreleased (2025-04-14)
+## Unreleased (2025-05-07)
 
 <section class="commits">
 
 ### Commits
 
 <details>
 
+-   [`3dd8cb3`](https://github.com/stdlib-js/stdlib/commit/3dd8cb379ea22c4a92d610d146cdd662d3187e27) - **chore:** minor clean-up _(by Philipp Burckhardt)_
 -   [`975147f`](https://github.com/stdlib-js/stdlib/commit/975147f3125c786ec1672acb3d2564ca16eaa790) - **docs:** fix TSDoc lint errors _(by Philipp Burckhardt)_
 
 </details>

CHANGELOG.md

@@ -51,15 +51,18 @@ Dorrin Sotoudeh <dorrinsotoudeh123@gmail.com>
 EuniceSim142 <77243938+EuniceSim142@users.noreply.github.com>
 Frank Kovacs <fran70kk@gmail.com>
 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>
@@ -85,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>
@@ -105,6 +109,7 @@ Naveen Kumar <stupiddint@gmail.com>
 Neeraj Pathak <neerajrpathak710@gmail.com>
 NirvedMishra <139633597+NirvedMishra@users.noreply.github.com>
 Nishant Shinde <97207366+nishant-s7@users.noreply.github.com>
+Nishant singh <38534128+Nishantsingh11@users.noreply.github.com>
 Nishchay Rajput <121144841+NishchayRajput@users.noreply.github.com>
 Nithin Katta <88046362+nithinkatta@users.noreply.github.com>
 Nourhan Hasan <109472010+TheNourhan@users.noreply.github.com>
@@ -177,12 +182,15 @@ Yaswanth Kosuru <116426380+yaswanthkosuru@users.noreply.github.com>
 Yernar Yergaziyev <yernar.yergaziyev@erg.kz>
 Yugal Kaushik <yugalkaushik14@gmail.com>
 Yuvi Mittal <128018763+yuvi-mittal@users.noreply.github.com>
+devshree-bhati <147095250+devshree-bhati@users.noreply.github.com>
 ditsu <170345142+ditsus@users.noreply.github.com>
 ekambains <bainsinbusiness@gmail.com>
 fadiothman22 <48636283+fadiothman22@users.noreply.github.com>
+iraandrushko <71790513+iraandrushko@users.noreply.github.com>
 lohithganni <116790357+lohithganni@users.noreply.github.com>
 olenkabilonizhka <62379231+olenkabilonizhka@users.noreply.github.com>
 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>

CONTRIBUTORS

@@ -27,7 +27,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).
 *