What is the name for a simple sorting algorithm that repeatedly swaps adjacent elements if they are in the wrong order?
- A. Backtracking
- B. Time complexity
- C. Bubble sort ✓
- D. Greedy algorithm
Correct answer
C. Bubble sort
Explanation
Bubble sort refers to a simple sorting algorithm that repeatedly swaps adjacent elements if they are in the wrong order.