Bubble sort:

• Bubble sort is a simple sorting algorithm.
• The input list is traversed from left to right.
• the current element is compared at each step to the right neighbor.
• Both elements are replaced if they violate the sort criteria.
• At the end of the phase is the largest or smallest element of the input end of the list in ascending or descending order.
• Is repeated until the entry bar is completely sorted.

Selection sort:

• Selection sort is an in-place comparison sort.
• It has O(n2) complexity.
• Selection sort is noted for its simplicity.
• also has performance advantages over more complicated algorithms in certain situations.
• The algorithm finds the minimum value, swaps it with the value in the first position
• repeats these steps for the remainder of the list.
• It does no more than n swaps, and thus is useful where swapping is very expensive.

Insertion sort:

• Insertion sort is a simple sorting algorithm.
• Is relatively efficient for small lists and mostly sorted lists.
• Is often used as part of more sophisticated algorithms.
• It works by taking elements from the list one by one and inserting them in their correct position into a new sorted list.
• In arrays, the new list and the remaining elements can share the array's space.
• Insertion is expensive.
• Requiring shifting all following elements over by one.