[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-Id: <20240113031352.2395118-1-visitorckw@gmail.com>
Date: Sat, 13 Jan 2024 11:13:50 +0800
From: Kuan-Wei Chiu <visitorckw@...il.com>
To: akpm@...ux-foundation.org
Cc: lkml@....org,
jserv@...s.ncku.edu.tw,
linux-kernel@...r.kernel.org,
Kuan-Wei Chiu <visitorckw@...il.com>
Subject: [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(-)
--
2.25.1
Powered by blists - more mailing lists