So we're all very familiar with sorting algorithms like insertion-sort, shell sort, bubble sort (whose fame exceeds its worth, tbh) :( , merge sort, quicksort, introsort, timsort, etc.

What about algorithms like shearsort and odd-even transposition sort? http://www.cs.rit.edu/~atk/Java/Sorting/sorting.html how do parallel algorithms work?

Question

So we're all very familiar with sorting algorithms like insertion-sort, shell sort, bubble sort (whose fame exceeds its worth, tbh) :( , merge sort, quicksort, introsort, timsort, etc.

What about algorithms like shearsort and odd-even transposition sort? http://www.cs.rit.edu/~atk/Java/Sorting/sorting.html how do parallel algorithms work?

anonymous · Answer

bubble sort is very worthy because it's easiest one :D

anonymous · Answer

I think insertion sort is easier.