1
Question
A sort which compares adjacent elements in a list and switches where necessary is a
A sort which compares adjacent elements in a list and switches where necessary is a
Open in App
Solution
The correct option is D Bubble Sort
A sort which compares adjacent elements
in a list and switches where necessary is a bubble sort.
Bubble sort is a simple sorting
algorithm that repeatedly steps through the list to be sorted, compares each
pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps
are needed, which indicates that the list is sorted.
A sort which compares adjacent elements in a list and switches where necessary is a bubble sort.
Bubble sort is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.
Suggest Corrections
0
Similar questions
View More
Join BYJU'S Learning Program
Explore more
Join BYJU'S Learning Program
