Explain the logic of "Bubble Sort". Why is it considered inefficient for large datasets compared to Merge Sort?

Explain the logic of "Bubble Sort". Why is it considered inefficient for large datasets compared to Merge Sort?

From the Combined Bank Assistant Programmer (CSE) January 2026 – Written exam, question 9 of 22.

More from this paper

Previous: You have two stacks. Explain the logic required to implement a Queue (FIFO) using only these two stacks.
Next: Draw or describe a Flowchart to determine the largest of three distinct numbers (A, B, C).
All questions in Combined Bank Assistant Programmer (CSE) January 2026 – Written