My attempt of making the fastest list sorter i can speed at the bottom(i know there are better sorting methods) How it works TLDR: Its overcomplicated and dosen't work well at all There are 2 lists the sorter gets the first item of the unsorted list if it is greater than the median of the sorted list it puts the item at the end of the sorted list and moves it down by 10's(i should make it adaptive based on the length) until it is at or past the right spot, then it moves it up by 1's until it is in the right spot if it is not greater than the median then it is put at the start of the sorted list and moved up by 10's until it is at or past the right spot, then it moves down by 1's until it is in the right spot red lines are unsorted and the black lines are sorted the red line in the black is the line it is placing list length of 10000 normal block: 3.45 seconds(measured with days since 2000) no screen refresh(setting): 2.42 seconds
the raw script(no pen stuff) is in the script sprite this project shows it sorting a 480 items long list where each item is random between 180 and -180 versions 1.0 made bubble sort basically 2.0 it goes up by 10's until it is at or past the right spot then it goes down 10 then goes up by 1's until its right 3.0 it goes up by 10's until it is at or past the right spot then it goes down 1's until it is in the right spot 3.5 if it is greater than the median of the sorted list it puts the item at the end of the sorted list and moves it down by 10's until it is at or past the right spot, then it moves it up by 1's until it is in the right spot if it is not greater than the median then it is put at the start of the sorted list and moved up by 10's until it is at or past the right spot, then it moves it down by 1's until it is in the right spot
