Start learning →

For a list of n elements, bubble sort makes a total number of passes equal to:

An over 2
Bn minus 1
Cn plus 1
Dn times 2
Answer & Solution
Correct answer: B. n minus 1
1. Each pass fixes one more element in place. 2. The final element needs no pass of its own. 3. So the total is n minus 1 passes. _Source: syllabus Computer Science Class XII, Chapter 5, Sorting._
Practise this question with Quill — Engineering — Tanzania →

Keep practising Sorting Algorithms

Browse all Sorting Algorithms questions for Engineering — Tanzania, or explore more Computer Science topics.

Start a Sorting Algorithms lesson →
Related questions