After years of making 3D projects, I finally decided to speed-test some of the most popular sorting algs used in 3D distance sorting. The conclusion? It turns out that insertion sort is the fastest, beating both quicksort and binary insertion sort. Why? If the distance sorting is implemented properly, it saves the list of distances from the previous frame, updates the distances for the current frame, and then sorts the updated list, which is already almost sorted. Scripts inside the project have brief descriptions of their functions. If you have any questions, please feel free to ask me in the comments! The project includes explanations of what the script does, how it does it, and what it's used for, in addition to a speed test to demonstrate how efficient it is on your own computer relative to the old sorting method. Don't forget to leave a love and a favorite, and follow me for more content! Curated by @Wolf_Silver 4/29/20 Thanks to -Rex- for the Quicksort alg
