I'm surprised that they found a legit use-case for bubble sort. I always had the impression that bubble sort had very little going for it because the naive impl

I'm surprised that they found a legit use-case for bubble sort. I always had the impression that bubble sort had very little going for it because the naive implementation is much slower than insertion sort, while also not being as intuitive. https://users.cs.duke.edu/~ola/bubble/bubble.html https://users.cs.duke.edu/~ola/bubble/bubble.html Out of curiosity, does anyone know how selection sort would compare to bubble sort and insertion sort in this kind of problem?