Max number: 700 (higher won't start) !!! Read !!! Gravity sort. Though it doesn't look like what you see in the youtube videos, it is still extremely inefficient and slow, and follows the implementation that I opened from the first link :D The whole process is incredibly huge and complicated that even I don't understand some parts. So it can't be visualised because it uses 2d array, the implementation of which I came up with right there. Maybe slow, maybe fast, so we have what we have, which is: 3 auxiliary arrays with two of 200k size both and third one with 90k size, which you will wait billions of hours for Scratch to draw it. *skull emoji*
Python3 implementation from https://www.geeksforgeeks.org/bead-sort-natural-sorting-algorithm/
