a day ago
- The author expresses strong dislike for bubblesort, considering it an awful sorting algorithm.
- Quadratic-time sorting algorithms like insertion sort and selection sort have practical uses (e.g., insertion sort for nearly sorted data, selection sort for minimal swaps).
- Bubblesort lacks the virtues of other quadratic algorithms: it is not useful as a subroutine, has no special-case performance advantages, and is not even the simplest to teach.
- Selection sort is argued to be simpler and more intuitive than bubblesort for educational purposes.
- The author concludes that bubblesort is never the best choice for any real-world or educational scenario.