Mastering Algorithms

What is the time complexity of Quick Sort in the average case?

• O(log n)

• O(n log n)

• O(n^2)

• O(n)

Which sorting algorithm is based on the divide and conquer technique?

• Bubble Sort

• Merge Sort

• Selection Sort

• Insertion Sort

What is the primary difference between linear search and binary search?

• Linear search requires a sorted list to function.

• Binary search can be used on unsorted lists.

• Linear search is sequential; binary search is logarithmic and requires a sorted list.

• Linear search is faster than binary search.

Which sorting algorithm is considered stable: Merge Sort or Quick Sort?

• Merge Sort

• Selection Sort

• Insertion Sort

• Bubble Sort

What is the worst-case time complexity of Bubble Sort?

• O(n log n)

• O(n)

• O(log n)

• O(n^2)

In which scenario would you prefer using a binary search over a linear search?

• When searching in a sorted dataset.

• When the dataset is small and unsorted.

• When searching in an unsorted dataset.

• When searching for a specific value in a linked list.

What is the main advantage of using Heap Sort?

• Guaranteed O(n log n) time complexity in all cases.

• It is stable and preserves the order of equal elements.

• It is the fastest sorting algorithm for large datasets.

• It requires less memory than Quick Sort.

Which algorithm is used to find the maximum or minimum element in a list?

• Merge Sort

• Linear Search

• Quick Sort

• Binary Search

What is the time complexity of Insertion Sort in the best case?

• O(n log n)

• O(1)

• O(n)

• O(n^2)

What is the key characteristic of a search algorithm that uses a sorted array?

• Search algorithms do not depend on data structure.

• Linear search is faster than binary search.

• Efficiency in searching due to the ability to use binary search.

• Sorted arrays cannot be searched efficiently.