For sorting ................ algorithm scans the list by swapping the entries whenever pair of adjacent keys are out of desired order.
A. Quick sort
B. Shell sort
C. Insertion sort
D. Bubble sort
Answer:D
For sorting ................ algorithm scans the list by swapping the entries whenever pair of adjacent keys are out of desired order.
A. Quick sort B. Shell sort C. Insertion sort D. Bubble sort