Which sorting algorithm repeatedly swaps adjacent elements that are in the wrong order?
Answer and explanation
Correct answer: C. Bubble sort
- Step 1: Bubble sort compares neighbours and swaps them.
Answer
Bubble sort.
Why not the others: Merge sort, Binary search and Quick sort do not fit.
Practise more Networks, security and data.
Free questions with an explanation for every one, and full timed Saudi Secondary School Certificate mock tests.
More Networks, security and data questions
- How many usable host addresses are in a network with prefix /30?
- How many usable host addresses are in a network with prefix /25?
- How many usable host addresses are in a network with prefix /29?
- How many usable host addresses are in a network with prefix /24?
- How many usable host addresses are in a network with prefix /26?
- How many usable host addresses are in a network with prefix /27?