Bubble Sort

Choose difficulty:

Beginner

Intermediate

Advanced

1. How many iterations of the outer loop are needed by the algorithm when the input array of size N is already sorted?

a: 0 Explanation

Explanation

b: 1 Explanation

Explanation

c: N Explanation

Explanation

d: 2N Explanation

Explanation

2. How many comparisons (same as the number of iterations of the inner loop) are required in the next iteration after T iterations of the outer loop in the optimized algorithm? The array size is N.

a: N Explanation

Explanation

b: N - 1 Explanation

Explanation

c: N - T Explanation

Explanation

d: N - T + 1 Explanation

Explanation

3. How do we check if our array is sorted in order to preemptively stop the optimized algorithm?

a: Run an extra iteration as part of the current iteration and check that all adjacent elements are in the right order. Explanation

Explanation

b: Check if any swaps occurred in the current iteration. Explanation

Explanation

c: There is no way to preemptively stop the algorithm, i.e, a minimum of N - 1 iterations is required where N is the array size. Explanation

Explanation

d: None of the above Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)