1.2.6 Algorithms Quiz

Which of the following best describes the Bubble Sort algorithm?

• It repeatedly merges subarrays until the whole array is sorted.

• It sorts the array by repeatedly swapping adjacent elements if they are in the wrong order.

• It sorts the array by dividing it into smaller parts and sorting each part recursively.

• It searches for an element by repeatedly dividing the sorted array in half.

What is the time complexity of the Bubble Sort algorithm in the worst case?

• O(n)

• O(log n)

• O(n log n)

• O(n²)

Which of the following algorithms is a divide-and-conquer algorithm?

• Bubble Sort

• Merge Sort

• Linear Search

• Binary Search

In the Merge Sort algorithm, what is the primary operation that occurs after the array is divided into smaller subarrays?

• Swapping adjacent elements

• Merging the subarrays back together in sorted order

• Finding the middle element

• Comparing each element with the pivot

What is the time complexity of the Merge Sort algorithm in the worst case?

• O(n)

• O(log n)

• O(n log n)

• O(n²)

Which search algorithm requires the data to be sorted before it can be applied?

• Linear Search

• Binary Search

How does the Binary Search algorithm find an element in a sorted array?

• By scanning each element from the start to the end of the array

• By repeatedly dividing the array in half and searching the relevant subarray

• By swapping elements until the array is sorted

• By merging two sorted halves

What is the time complexity of the Binary Search algorithm in the worst case?

• O(n)

• O(log n)

• O(n log n)

• O(n²

Which of the following is true about the Linear Search algorithm?

• It is more efficient than Binary Search for large datasets.

• It can only be applied to sorted arrays.

• It has a time complexity of O(n) in the worst case.

• It is a divide-and-conquer algorithm.

If you have an unsorted array of 1000 elements and need to search for a specific element, which algorithm would be most appropriate?

• Bubble Sort

• Merge Sort

• Binary Search

• Linear Search