Re: qsort() documentation

From: Ryan Stone <rysto32_at_gmail.com>
Date: Mon, 18 Apr 2016 09:25:40 -0400
On Mon, Apr 18, 2016 at 9:09 AM, Hans Petter Selasky <hps_at_selasky.org> wrote

> I think the algorithm is switching to mergesort. I'll look up the paper
> and add that correctly before commit.
>

No, it switches to insertion sort, assuming that it's acting on an already
sorted array.  If that assumption is wrong you still get O(n**2) complexity.
Received on Mon Apr 18 2016 - 11:25:41 UTC

This archive was generated by hypermail 2.4.0 : Wed May 19 2021 - 11:41:04 UTC