Grantham University Computational Complexity & Memory Usage Discussion
Question Description
There are many sorting algorithms that are used in computer science. Generally, we can classify them by the following:
- Sorting method
- Memory usage
- Computational complexity (best, average, or worst)
From the list below, select at 2 sorting algorithms and do the following:
Describe how each selected algorithm works
- Use the 3 categories (memoryusage, sorting method, Computational complexity (best, average, orworst) to analyze and compare your selected algorithms
- Discuss the possible application of sorting algorithms you selected, 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
"Place your order now for a similar assignment and have exceptional work written by our team of experts, guaranteeing you "A" results."
