This is the mail archive of the
libc-alpha@sourceware.org
mailing list for the glibc project.
Re: [PATCH 1/1] msort : optimizing merge sort.
- From: Siddhesh Poyarekar <siddhesh at gotplt dot org>
- To: Ayush Mittal <ayush dot m at samsung dot com>, libc-alpha at sourceware dot org
- Cc: pankaj dot m at samsung dot com, Vaneet Narang <v dot narang at samsung dot com>
- Date: Thu, 6 Jul 2017 09:55:45 +0530
- Subject: Re: [PATCH 1/1] msort : optimizing merge sort.
- Authentication-results: sourceware.org; auth=none
- References: <CGME20170706040233epcas5p2ce07fffff862ed1c60c1fc7a83b244be@epcas5p2.samsung.com> <1499313544-18244-1-git-send-email-ayush.m@samsung.com>
On Thursday 06 July 2017 09:29 AM, Ayush Mittal wrote:
> This patch improves the performance of merge sort when most of the elements are already sorted .
> It improves performace of merge procedure by skipping comparison and copying of elements
> when last element of first array and first element of second array is already sorted .
>
> When we simulated optimzed merge sort,the performace increases by 84% when mergesort
> is used for already sorted elements .
Please also include the benchmark you used to measure this. Take a look
at benchtests/README to know ways in which you can include your
benchmark in glibc.
Also, please take a moment to review the contribution checklist[1] to
know the kind of information you need to include in your patch
submission. For example this submission is missing a ChangeLog.
Thanks,
Siddhesh
[1] https://sourceware.org/glibc/wiki/Contribution%20checklist