SORTING

Research an application or scenario that the following sorting algorithms can be applied (include a description and an image):
 

• Bubble sort - often incorrectly referred to as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order.

• Selection sort - is a sorting algorithm, specifically an in-place comparison sort. It has O(n²) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort.

 

• Insertion sort - is a simple sorting algorithm: a comparison sort in which the sorted array (or list) is built one entry at a time.
• 
  
   
  

• Shell sort - also known as Shell sort or Shell's method is an in-place comparison sort.
• 

• Bucket sort or bin sort - is a sorting algorithm that works by partitioning an array into a number of buckets.
• 
  
   

• Merge sort - is an O(n log n) comparison-based sorting algorithm.
• 

• Quick sort - is a sorting algorithm developed by Tony Hoare that, on average, makes O(nlog n) comparisons to sort n items.
•