For a list of n elements, bubble sort makes how many passes?

Question

Accepted Answer

A. n minus 1

1. Each pass fixes one more element into place.
2. The final element is left correct by elimination.
3. For a list with n elements, bubble sort makes a total of n minus 1 passes.
4. So the answer is n minus 1.
_Source: syllabus Computer Science, Ch 5 'Sorting' and Ch 6 'Searching'_

Answer

n minus 2

Answer

n minus 3

Answer

n minus 4

For a list of n elements, bubble sort makes how many passes?

Keep practising Sorting and Searching