JAVALO3

Big-O notation describes the upper bound of the time complexity of an algorithm

• True

• False

Which of the following best describes the Big-O notation?

• It represents the exact running time of an algorithm.

• It describes the worst-case scenario of an algorithm's time complexity.

• It provides a lower bound on the time complexity of an algorithm. 

• It only considers the best-case scenario of an algorithm's time complexity.

Select all statements that correctly describe the use of Big-O notation:

• It helps in comparing the efficiency of different algorithms.

• It considers all possible cases of an algorithm's performance. 

• It quantifies the rate at which the runtime of an algorithm increases with the size of the input.

• It is used to measure the space complexity of an algorithm.

• It provides an exact measurement of the execution time of an algorithm.

In the Bubble Sort algorithm, what is the time complexity for sorting an array of n elements?

• O(2ⁿ)

• O(n log n) 

• O(n²)

• O(n)

Bubble Sort is a stable sorting algorithm, meaning it preserves the relative order of equal elements in the sorted array.

• True

• False

Which of the following statements is true about Selection Sort?

• It repeatedly selects the smallest (or largest) element from the unsorted part of the array and moves it to the sorted part.

• It has a time complexity of O(n log n).

• It is a stable sorting algorithm.

• It is always faster than Bubble Sort.

Selection Sort performs better than Merge Sort for large input sizes.

• True

• False

Which of the following statements are true about Merge Sort?

• 
   It is a stable sorting algorithm.

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

• It requires additional memory space proportional to the size of the input array.

• It is an in-place sorting algorithm.

• It divides the array into smaller subarrays until each subarray has only one element.

Which of the following steps are involved in the Merge Sort algorithm?

• Recursively apply Merge Sort to each half of the array.

• Select the smallest element and move it to the beginning of the array.

• Divide the array into two halves.

• Merge the sorted halves to produce the final sorted array.

• Swap adjacent elements if they are in the wrong order. 

Quick Sort performs better than Bubble Sort for almost all input sizes.

• True

• False