Bubble Sort is an interesting case, with some useful properties.
It can be applied incrementally, using atomic operations, and be aborted at any point, leaving the data not less ordered.
Which means it's useful for things that benefit from, but do not require, ordering, and where the time available for sorting is uncontrollabe.
Like when operating within a vertical trace interrupt, when those were a thing.
This makes it an interesting contrast to quicksort & bubble sort, radix sort, and the insertion sort families.
It's well worth studying.
Very interesting, thank you!
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Bubble Sort is an interesting case, with some useful properties.
It can be applied incrementally, using atomic operations, and be aborted at any point, leaving the data not less ordered.
Which means it's useful for things that benefit from, but do not require, ordering, and where the time available for sorting is uncontrollabe.
Like when operating within a vertical trace interrupt, when those were a thing.
This makes it an interesting contrast to quicksort & bubble sort, radix sort, and the insertion sort families.
It's well worth studying.
Very interesting, thank you!