Bubble Sort and Quick sort

Question

Briefly describe the term Bubble Sort and Quick sort?

Answer 1

Bubble Sort : The easiest sorting algorithm. It involves the sorting the list in a repetitive fashion. It compares two adjacent elements in list, and swaps them if they are not in designated order. It continues till there are no swaps required. This is the signal for list that is sorted. It is also named as comparison sort as it employs comparisons.

Quick Sort : The most excellent sorting algorithm that implements the ‘divide and conquer’ concept. It first divides the list in two parts by picking the element a ’pivot’. It then arranges the elements those are smaller than pivot in one sub list and elements those are greater than pivot in one sub list by keeping pivot in its original place.