On Mon Jul 07 00:13:20 2008, [EMAIL PROTECTED] wrote:
> On Sunday 06 July 2008 22:17:12 Andrew Johnson via RT wrote:
>
> > On Sun Jul 06 11:03:37 2008, japhb wrote:
>
> > > Better yet, we should replace the inherently insecure quicksort
> > > algorithm (insecure in the "vulnerable to algorithmic
On Sat, 2008-07-05 at 20:11 -0700, Andrew Johnson wrote:
> Parrot_quicksort() is in src/utils.c; the first do-while loop has nothing to
> stop it when j reaches 0, so it keeps going outside of the data array. I
> guess that the while condition needs j > 0 adding to it to prevent that from
> happeni
# New Ticket Created by Andrew Johnson
# Please include the string: [perl #56636]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt3/Ticket/Display.html?id=56636 >
If sort is given a comparison function that always returns >0, the result is
a segfaul
