Number Sort Algorithm

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