A sorting algorithm I came up with. Steps: 1: Finds the first number in the list it hasn't checked already. Stores in variable. 2: Finds the smallest number that it hasn't already swapped. Stores in variable. 3: Swaps the two. 4: repeat steps 1-3 for the length of your list. All packed into one neat custom block, just backpack it! Uses hacked blocks to make it easier.
