Sorting algorithms are procedures used to reorder elements in a list or array so that

they follow a specific sequence or order, typically numerical or lexicographical

$($alphabetical$).$ The purpose of sorting is to arrange data in a manner that allows for

more efficient search, analysis, and usage.

There are many different sorting algorithms, each with its own approach and

characteristics. The effectiveness and efficiency of these algorithms can vary based

on the size and nature of the dataset.

Discuss and differentites any FIVE $(5)$ from the following sorting algorithms:

$$ Insertion sort

$$ Bubble sort

$$ Heap sort

$$ Radix sort

$$ Merge sort

$$ Quick sort

$$ Shell sort

$$ Selection sort

You may use a table for the analysis. Summarize your finding not less than $4$ pages

of A$4$ size.

List all references in bibliography