DPQ
completely. This is because in real DPQ every item is not compared with
pivots in well defined order and
real DPQ contains numerous special cases, which make it harder to analyze.
Regards,
Dmytro Sheyko
> From: [email protected]
> To: [email protected]
> Subject
o: [email protected]
> Subject: Question on sorting
> Date: Fri, 30 Jul 2010 22:55:00 +0400
> CC: [email protected]
>
> Hello,
>
> I have performance question in sorting.
>
> In an implementation of Dual-Pivot Quicksort 5 elements
>
> a[e1], a[e2], a[e
Hello,
I have performance question in sorting.
In an implementation of Dual-Pivot Quicksort 5 elements
a[e1], a[e2], a[e3], a[e4], a[e5]
where e1 = len/6, e2 = len/3, e3 = len/2, e4 = len*2/3, e5 = len*5/6,
are sorted and then elements a[e2], a[e4] are taken as pivots.
but if I take a[e1] and
