Algorithms

Question 1

What is the purpose of bubble sort?

Answer 1

To repeatedly swap adjacent elements if they are in the wrong order.

Question 2

How many passes does bubble sort require?

Answer 2

Up to n-1 passes for an array of size n.

Question 3

What is the time complexity of bubble sort?

Answer 3

O(n^2) for the worst and average cases.

Question 4

How do you check if a bubble sort pass made no swaps?

Answer 4

Use a boolean flag.

Question 5

Can bubble sort handle strings?

Answer 5

Yes, by comparing string values lexicographically.

Question 6

Is bubble sort stable?

Answer 6

Yes, because it preserves the relative order of equal elements.

Question 7

How can you optimize bubble sort?

Answer 7

Stop the algorithm if no swaps occur in a pass.

Question 8

Write a basic bubble sort algorithm for integers.

Answer 8

for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}

Question 9

Why is bubble sort inefficient for large datasets?

Answer 9

Due to its quadratic time complexity.

Question 10

What data structure works best with bubble sort

Answer 10

Arrays or lists with small datasets.