Question

come up with at least 2 real-time examples on the Insertion sort, Bubble sort, Selection sort, Quick sort, Shell sort, Merge sort, Radix sort, Bucket sort, and Counting sort.

Answer 1

Insertion Sort:-

• Sorting short lists
• Sorting “almost sorted” lists

Bubble sort:-

• Used in acadmics to introduce 1st-year computer science students to concept of sorting algorithm.
• Comparably simpler to understand than some other sorting algorithms.

Selection sort:-

• Often sort that humans intuitively use when for example sorting deck of cards.
• We can visually see max or min element from elements of unsorted list, pick it up and place it in a sorted list.

Quick sort:-

• medical monitoring
• life support in aircraft & spacecraft

Shell sort:-

• Shellsort perform more operations and has higher cache miss ratio than quicksort.
• Shellsort can serve as sub-algorithm of introspective sort, to sort short subarrays and to prevent a slowdown when the recursion depth exceeds a given limit.

Merge sort:-

• Merge sort is used in external sorting.
• Merge sort is used for counting inversions in list.

Radix Sort:-

• Radix sort is widely used for stably sorting strings.
• Variants of radix sort are used for constructing suffix arrays, BWT, etc.

Bucket sort:-

• Bucket sort is used when input is uniformly distributed over a range.
• Used in case there are floating point values.

Counting sort:-

• Used when it sorting countable objects,.
• Complexity is O(N+K) so give best result in certain cases.