Question

______ Sorting compares two adjoining values and exchange them if they are not in proper order.
1. Heap
2. Selection
3. Insertion
4. Bubble

Answer 1

Correct Answer - Option 4 : Bubble

Heap Sort	It arranges the values in a heap and sort them.
Selection Sort	It starts with finding the min value and place in its perfect place each time ,in this way it sorts all values.
Insertion sort	Divides the list in two parts sorted part and unsorted part,then keed each element in sorted part at its perfect place.
Bubble sort	It compares two adjoining values and exchange them if they are not in proper order.