Question

Explain in enough detail so I know you understand how algorithms like QSort and MergeSort are different than algorithms like Bubble, Insertion, Selection and Shell sorting techniques. Please note that if your answer exceeds more than 100 words, your answer most likely contains content not related to the question. This implies your answer should address the question directly, rather than include extraneous comments.

Answer 1

Solution : Note : QSort function uses QuickSort ( QuickerSort ) algorithm for performing sorting. I am listing out three major differences below which will elaborate how algorithms like QSort and MergeSort are different than algorithms like Bubble, Insertion, Selection and Shell sorting techniques :

(a) Qsort and MergeSort are the more popular sorting techniques than Bubble, Insertion, Selection and Shell sorting techniques because Qsort and MergeSort have the best time complexity in all the given sorting algorithms here ( Bubble, Insertion, Selection and Shell sorting ). i.e., Qsort and MergeSort have O(nlogn) time complexity whereas Bubble, Insertion, Selection and Shell sorting techniques have O(n²) time complexity.

(b) Qsort and MergeSort use Divide-and-Conquer technique for performing sortings whereas Bubble, Insertion, Selection and Shell sorting techniques does not use Divide-and-Conquer techniques for performing sortings.

(c) Qsort and MergeSort use recursion for performing sortings whereas Bubble, Insertion, Selection and Shell sorting techniques do not use recursion for performing sortings.