Number Sort Algorithm

[Ioannis]

and needs an 'c' in expealidoius like: expealidocius

Ioannis

[Darrel Taylor]

The biggest problem is that it takes longer than a second to say it.

There's no way to say the whole thing at exactly 3:03 am.

But backwards (according to the movie) would be.
dociousaliexpiisticfragilcalirupus

docious-ali-expi-istic-fragil-cali-rupus
<br>

[T.Jackson]

Legend has it that if you stand in front of a mirror, any time past midnight, and say three times; "I don't believe in the Bell Witch" - the next morning you will wakeup with finger nail scratches on your cheek.

[Darrel Taylor]

Do you have any more of those pills?

And, can I have some??
<br>

[T.Jackson]

That legend is for real Darrel.

[Melanie]

> next morning you will wakeup with finger nail scratches on your cheek.

... and there I was wondering why I never get dated more than once!

[vaporized]

Hello.
I apologize for reviving old thread but forum is already crowded with so many topics I don't want to aggrandize it further.

In mrs. Melanie's routine I don't understand the following:

SortArray:
   ...
   IF CounterA>0 then CounterA=CounterA-2
   ...
   CounterA=CounterA+1
IF CounterA<15 THEN SortArray

As I see it, after the first pass through the loop CounterA is 1, so when it hits IF CounterA>0... wouldn't that make CounterA bigger than15 and exit the loop (CounterA war byte so 1-2=255)?
Can someone please explain it to me?