Comments

1. 

   0
   admin

   Owner

   4 months ago

   2024-10-03 1:46:53

   QuickSort is not stable because it involves swapping while sorting it swaps when next elements is less then pivot, and it will swaps the first greater elements.

   MergeSort is stable, merge sort does not involves swapping. it divide the unsort array into half each time until the length becomes 1, and array with 1 elements is always sorted. then combine 2 array and sort them, if they are the same, it will just append. Do the same process to other elements until we comined all elements. (1 combine to 2, 2 combine to 4 …..)

   Hence Merge sort is better in a scenario where stability is important.

   QuickSort is not stable because it involves swapping while sorting it swaps when next elements is less then pivot, and it will swaps the first greater elements. MergeSort is stable, merge sort does not involves swapping. it divide the unsort array into half each time until the length becomes 1, and array with 1 elements is always sorted. then combine 2 array and sort them, if they are the same, it will just append. Do the same process to other elements until we comined all elements. (1 combine to 2, 2 combine to 4 .....) Hence Merge sort is better in a scenario where stability is important.

   Reply