Which of the following sorting algorithms is not a comparison-based algorithm?Group of answer choicesInsertion sortQuick SortBubble SortRadix Sort

The sorting algorithm that is not a comparison-based algorithm among the given options is Radix Sort.

Here's why:

1. Insertion Sort: This is a comparison-based sorting algorithm. It builds the final sorted array one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.

2. Quick Sort: This is also a comparison-based sorting algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.

3. Bubble Sort: This is another comparison-based sorting algorithm. It works by repeatedly swapping the adjacent elements if they are in the wrong order.

4. Radix Sort: This is a non-comparison based sorting algorithm. It avoids comparison by creating and distributing elements into buckets according to their radix. For elements with more than one significant digit, this process is repeated for each digit, while preserving the ordering of the prior step, until all digits have been considered. For this reason, Radix Sort is different from the other three given sorting algorithms.