Yeah i tried that a while back and it doesnt work for reasons calc84 understands.  Do you think there is any way around dividing directly by 5?  Maybe involving multiplication and bit shifts?  Or should i try to convert everything to 4x4?

Here is an implementation of a quick bubble sort.  Its not very fast, but i couldnt get the merge sort to work.  It can sort 100 elements in about a second

List is sorted in place in L1 (no other lists needed)
N is length

1->S
While S
0->S
For(F,0,N-1
If {L1+F}>{L1+F+1}
Expr(L1+F,L1+F+1,1
1->S
End
End
End

Methinks because strings in Basic programs are not the same as strings in compiled axe programs?  Not sure...

Or it could be like what weregoose does where he just keeps putting together random tokens until he gets the most efficient and speedy solution.

The switch statement is this:  Sometimes you have data you want to be loaded, or specific things to do under specific circumstances.  Usualy you have to do this with a list of If statements like this:

If A=1
Blah
End
If A=2
Blalala
End
If A=3
Bluhuh
End
If A=4
Wooo
End
If A=5
Rickroll
End
If A=6
Grrrr
End
but with a switch statement you could do something like this

Switch(A)
1:Bla
2:Woooo
3:Grrrr
4:Rickroll
5:Chocolate rain
6:Lobser
End
Which is a lot easier on the eyes Although it probably would have zero affect on compiled size or speed.  Normaly it is just a feature to make things look nice

I have it as 4 times slower, and it is looking good ^^

Yep, sounds good to me, I will have the 'stuck' portal either stop animating altogether or just animate slower.  That way when you press 5 you know which one is stuck.  And then if its not the right one... Hmm press 5 again? 

Mmm so like when you press 5, the most recent Portal that has been shot becomes the only one that you can shoot?  And then when you press 5 again it goes back to normal?