quick sort, 600 items, 1 frame delay. fisher-yates algorithm for shuffling quick sort's nice making this was... something else since quick sort uses recursive calling of a function, and that required having a function-scoped variable of some sort, which... doesn't really exist here? so i tried to make a workaround using clones. when I made this, I noticed that how I put it together, this will run in parallel, therefore making this solve quicker. but i decided, not really. [p] to toggle paralellness
