This is another sorting algorithm I made. This sorting algorithm works by splitting each list into tiny sets of two items, making binomial heaps out of them, then merging the heaps to make bigger binomial heaps. If the amount of items is not a power of two, then the list is first split into smaller lists with a length of a power of two, making binomial heaps out of them, then merging the heaps to make a weird pseudo-binomial heap. The final part is by removing the last item, moving the next-last item to the position of the deleted item on the tree, then ordering the numbers again.
en.wikipedia.org/Binomial_Heap gave me the inspiration to use binomial heaps in a sorting algorithm. Later I will put optimizations of this sorting algorithm into another project.
