This algorithm works by comparing each item in the list with the item next to it, and swapping them if required. This process repeats until the list is fully sorted. a) Bubble b) Insertion c) Merge d) Selection

Question

Zachary Prince

Computers & Technology

29 August, 15:14

This algorithm works by comparing each item in the list with the item next to it, and swapping them if required. This process repeats until the list is fully sorted. a) Bubble b) Insertion c) Merge d) Selection

+2

Answers (1)

Know the Answer?

Carl Nolan · Answer 1

Answer: a) Bubble sorting

Explanation:

Bubble sorting is defined as algorithm that is used for sorting list elements by repeating itself through comparing elements of the list that are adjacent to each other. The elements get swapped if they are found in incorrect order by comparison. This process continues till the listed is sorted.

Other options are incorrect because insertion sort is the sorting process that takes place through placing the elements at correct position one at a time. Merge sort uses divide and conquer techique for dividing up the elements into sub-list and then merging it accordingly to sort. Selection sort is type of sorting based on dividing the list in left and right parts to place elements correctly. Thus, the correct option is option (a).