It reorders a list so it will be in alphabetical order by only the first letters of the words. It is designed for my TURDS++ engine's backpack edition, and it works perfectly. Reordering the whole list to be in alphabetical order would slow it down, so there would be no good reason to make it so. Update: I made v.1.2 that can reorder the list in about 7 seconds. v1.1 turned out to be about 12 times faster in this experiment, though there were only 3 times with v1.0 due to that being so slow. I considered v1.0 as fast when I first made it. v1.0 even lost in TurboWarp to v1.1 in Scratch OwO. I have no intention on making a version of this that would reorder the whole thing to be in absolute alphabetical order. The idea of this project is to show how much faster the v1.1 is compared to the other. Also, to show my really fast, almost alphabetical reorderer. Tests: __v1.1___ 11.616 sec | 11.682 sec | 11.880 sec 12.441 sec | 12.045 sec | 11.979 sec 12.243 sec | 12.012 sec | 11.848 sec Average ≈ 11.972 sec __v1.0___ 140.910 sec | 146.322 sec | 143.352 sec Average ≈ 143.528 sec I was able to get 106.853 sec by replacing some # blocks with variables to avoid lag. 143.528 / 11.972 ≈ 11.989 times faster.
