An inefficient method of bubble sort made that uses an auxiliary array due to the inability to write over items in the list. Yes, I know this project uses writing over but it's just for visualisation purposes, in the actual sort you would demolish the original list and replace it with the new one Worst: n^3 Average: n^3 Best: n^2 Stable: yes inplace: no
I created this originally to make a sort in Apple Shortcuts, where swaps cannot be used. This showcases an inefficient way of implementing swaps Name inspired by Fubble Sort https://scratch.mit.edu/projects/445152304/
