The spaghetti sort algorithm.
This sorting algorithm isn't really well known so i'll try to explain how it works and what's special about it. This sorting algorithm works by removing the smallest item from a list and adding it to a new list, and repeating that until there is no more items in the first list. The reason why this sorting algorithm is so special is because it's the only algorithm (i could find) with a speed of O(n), meaning that if you double the size of the list you want to sort, the time it takes to sort that list also doubles, which is not the case with other algorithms which either have a speed of O(n*log(n)), O(n^2), or even O(n*n!), which means that if you double the size of the list you want to sort, the amount of time it takes to sort it increases by MORE than double.
