This question involves comparing the sorting algorithms that westudied so far such as selection sort, bubble sort, insertion sort,merge sort & quicksort. First briefly explain the idea behindeach of them. And then compare them according to the criterion suchas time (best, worst and average case) and space efficiency,stability, applicability (when performs best) etc.
You may use following links as hints, however you will be ableto find a significant number of links that compare sortingalgorithms. Make sure that you check the validity of anyinformation found in any website before using them and if usedacknowledge the references properly. [25 points]
http://www.sorting-algorithms.com/
http://courses.cs.vt.edu/csonline/Algorithms/Lessons/index.html
http://www.codeproject.com/Articles/132757/Visualization-and-Comparison-of-sorting-algorithms
Java