in reply to
Re: Exceptional sorting
in thread
Exceptional sorting
> For every element 0000n (a "normal 0"), replace that element by the element to the right of it
Do that only if the element to the right of it is not a '0000n' also.
p
e
l
a
g
i
c
Comment on
Re: Re: Exceptional sorting
Replies are listed 'Best First'.
Re: Re: Re: Exceptional sorting
by
PerlingTheUK
(Hermit)
on May 25, 2004 at 10:43 UTC
Most would be 0000n.
[reply]
In Section
Seekers of Perl Wisdom