Exercise

1. If an array arr = {55, 42, 4, 31} is given and bubble sort is used to sort the array elements, then how many iterations will be required to sort the array?
   1. 3
   2. 2
   3. 1
   4. 0
2. What is the worst-case complexity of bubble sort?
   1. O(n log n)
   2. O(log n)
   3. O(n)
   4. O(n²)
3. Apply quicksort to the sequence (56, 89, 23, 99, 45, 12, 66, 78, 34). What is the sequence after the first phase, and what pivot is the first element?
   1. 45, 23, 12, 34, 56, 99, 66, 78, 89
   2. 34, 12, 23, 45, 56, 99, 66, 78, 89
   3. 12, 45, 23, 34, 56, 89, 78, 66, 99
   4. 34, 12, 23, 45, 99, 66, 89, 78, 56
4. Quicksort is a ___________
   1. Greedy algorithm
   2. Divide and conquer algorithm
   3. Dynamic programming algorithm
   4. Backtracking algorithm
5. Consider a situation where a swap operation is very costly. Which of...