Number Sort Algorithm

[Darrel Taylor]

Thank you, thank you,

So now that I've proven to myself that it works, ...
back to the topic ...

I think that changes Melanie's Sort from Post #4, to ...

	CounterA var Byte
	RawData var Byte [16]
	.. ..

		'
		'	Sort Array
		'	----------
SortArray:
	CounterA=0
SortLoop:
	If RawData(CounterA+1) < RawData(CounterA) then
		RawData(CounterA)     = RawData(CounterA) ^ RawData(CounterA+1)
		RawData(CounterA+1+0) = RawData(CounterA) ^ RawData(CounterA+1)
		RawData(CounterA)     = RawData(CounterA) ^ RawData(CounterA+1)
		If CounterA > 0 then CounterA=CounterA-2
		endif
	CounterA=CounterA+1
	If CounterA < 15 then goto SortLoop
	Return

Now I've got to wonder if it makes any difference?

edit: The added array operations would probably even slow it down.
<br>

[Ioannis]

The one thing for sure is that code will use one variable less.

As for speed, I don't know. Operation either on swap or with the XOR thing i believe are the same...

Ioannis

[T.Jackson]

You know, if you say Super-cala-fragile-listic-expealidoius, backwards, at exactly 3:03 am, the Blair Witch will appear before you and grant you with exactly one wish. Be careful what you wish for though.

[Ioannis]

You know, if you say Super-cala-fragile-listic-expealidoius, backwards, at exactly 3:03 am, the Blair Witch will appear before you and grant you with exactly one wish. Be careful what you wish for though.

Didn't that was said by Mary Poppins? Iliked it a lot!

But how does this connect with the above? Sorry I cannot understand, as english is second language to me.

Ioannis

[Melanie]

It doesn't work (because Trent forgot to use his spellchecker)... I'm worried about the 'fragile' section in the middle of the word...

[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>

[kenif]

Thank you, thank you,

So now that I've proven to myself that it works, ...
back to the topic ...

I think that changes Melanie's Sort from Post #4, to ...

	CounterA var Byte
	RawData var Byte [16]
	.. ..

		'
		'	Sort Array
		'	----------
SortArray:
	CounterA=0
SortLoop:
	If RawData(CounterA+1) < RawData(CounterA) then
		RawData(CounterA)     = RawData(CounterA) ^ RawData(CounterA+1)
		RawData(CounterA+1+0) = RawData(CounterA) ^ RawData(CounterA+1)
		RawData(CounterA)     = RawData(CounterA) ^ RawData(CounterA+1)
		If CounterA > 0 then CounterA=CounterA-2
		endif
	CounterA=CounterA+1
	If CounterA < 15 then goto SortLoop
	Return

Now I've got to wonder if it makes any difference?

edit: The added array operations would probably even slow it down.
<br>

This sort just saved my butt, thank you.
As the PICs get faster, speed is less of a consideration.