Different between quick and merge sort algorithms

Question

What are the different between quick and merge sort algorithms?

Answer 1

Quick sort:

It utilizes the ‘divide and conquer’ model by dividing the list of elements to two sub elements:

The procedure is as given below:

a. Choose an element, pivot, from the list.

b. Again arrange the elements within the list, hence all elements those are less than the pivot are already arranged before the pivot and all elements which are greater than the pivot are arranged after that pivot. Here the pivot is put on its position.

c. Sort the both sub lists: both sub list of the elements that are less than the pivot and the list of elements that are more than the pivot recursively.

Merge Sort:

This sort is a comparison based sorting algorithm. The input order is preserved within the sorted output.

Merge Sort algorithm is as given below:

a. The length of the list is 0 or 1, and then this is seemed as sorted.

b. If not, divide the unsorted list in 2 lists each approximately half the size.

c. Sort every sub list recursively. Implement the step 2 till the two sub lists are sorted.

d. Like a last step, combine i.e. merge both the lists back within one sorted list.