Change the sliders, then press one of the four buttons on the bottom to test their speed. The test repeatedly randomizes the list, then applies the sort. The current test and the total time will be displayed on top of the list.
I made 3 variant sorts of the very fast Radix Sort made by @ChromeCat_test . Radix sort - made by @ChromeCat_test Count sort - applies an in-place count sort when sorting digits instead of a bucket method. It uses 0 additional lists, does not have bucket overflow, and has the best space complexity, but the method adds a lot of extra time 2 Radix sort - sorts the list between two buckets instead of copying the bucket back to the list each iteration. It has the worst space complexity, but is quite fast. Chunk sort - sorts the list into linked list buckets instead of fixed-length arrays. It does not have bucket overflow and has better space complexity, but the data structure slows it down No digit-unrolled variants are included in this project. Extra Note: I noticed while making this project that copying, deleting, and pasting a large section of block code, then adding it back to its original place, can speed up its interpretation by up to around 40%, but this speedup goes away if the project is reloaded. (Firefox Exclusive)
