lib/sort: Optimize the number of swaps and comparisons
Status from this message: [merged mm-hotfixes-stable] lib-sort-optimize-heapsort-with-double-pop-variation.patch removed from -mm tree
Get series with b4
b4 am [email protected]Versions newest first
Patches in v1 All 2 applied
| # | Subject and files | Size | Replies | Applied |
|---|---|---|---|---|
| 1/2 | lib/sort: Optimize heapsort for equal elements in sift-down pathlib/ | +1 | 0 replies | Applied |
| 2/2 | lib/sort: Optimize heapsort with double-pop variationlib/ | +14 | 18 replies | Applied |
Reviews trailers per patch
None of the 2 patches has a Reviewed-by or Acked-by.
| Patch | Julian Sikorski |
|---|---|
| 1/2 | |
| 2/2 | T-b |
Trailers given in replies are filled; those carried in the patches from earlier versions are outlined with dashes.
Cover letter [PATCH 0/2] lib/sort: Optimize the number of swaps and comparisons
Hello,
This patch series aims to optimize the heapsort algorithm, specifically targeting a reduction in the number of swaps and comparisons required.
Thanks,
Kuan-Wei Chiu
Kuan-Wei Chiu (2):
lib/sort: Optimize heapsort for equal elements in sift-down path lib/sort: Optimize heapsort with double-pop variation
lib/sort.c | 20 +++++++++++++++----- 1 file changed, 15 insertions(+), 5 deletions(-)
Signature · 1 line
2.25.1