Question Select at least 3 sorting algorithms from the list below. Use the categories discussed in the Discussion Board (computational complexity, memory usage, and sorting method) to analyze and compare the selected sorting algorithms. Add a field to provide a brief description of how each algorithm works. Present your analysis using a table. Use the columns for categories and the rows to list the algorithms.
In a separate paragraph, discuss the possible application of sorting algorithms and why sorting is useful in the field of computer science.
- Sorting Algorithms
- Selection sort
- Insertion sort
- Shell sort
- Bubble sort
- Quick sort
- Heap sort
- Tree sort
- Merge sort
- Radix sort