CS Algorithms Quiz

What is the time complexity of the best case scenario for the QuickSort algorithm?

Which of the following is not a stable sorting algorithm?

• Bubble Sort

• Merge Sort

• QuickSort

• Insertion Sort

In a binary search algorithm, what must be true about the collection to be searched?

• The collection must be in ascending order.

• The collection must be in descending order.

• The collection does not need to be sorted.

• The collection must be a linked list.

What does the following pseudocode do? ``` function factorial(n): if n == 0: return 1 else: return n * factorial(n-1) ```

• Calculates the sum of all numbers up to n

• Calculates the nth Fibonacci number

• Calculates the factorial of n

• Calculates n to the power of n

Which sorting algorithm repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order?

• Selection Sort

• Bubble Sort

• Merge Sort

• QuickSort

What is the worst-case time complexity of the linear search algorithm in an array of n elements?

Which of the following is a characteristic of recursion?

• It can only solve problems that are inherently iterative.

• It breaks down a problem into smaller instances of the same problem.

• It is always the most memory-efficient solution.

• It cannot be used in sorting algorithms.

What is the primary advantage of using Merge Sort over QuickSort?

• Faster in all cases

• More space-efficient

• Easier to implement

In pseudocode, what does the following statement typically mean? ``` x <- 5 ```

• x is less than -5

• x is assigned the value 5

• x is compared to 5

• x is subtracted by 5

Which search algorithm is particularly effective if the elements are uniformly distributed?

• Linear Search

• Binary Search

• Interpolation Search

• Exponential Search