Thanks Enora. I used your idea to make a sorting procedure (I think it uses the same method as bubble sorting, right?)
Anyway, is fast until you try to sort a big list (more then 100). For projects that do not require too many numbers, it will be OK.
There's also an .aia to demonstrate how to use it and how fast/slow it is.
You just call the procedure with a list of numbers as a parameter and the letter "a" for Ascending order or a "d" for descending order. (actually, anything that's not an "a" will produce descending order).
And it returns the same list ordered.
![](https://lh3.googleusercontent.com/-3bLuPssVSns/Va1nT51cYEI/AAAAAAAACNw/cxBPa3LaV3I/s1600/sort.jpg)