Algorithms Sorting & Searching Algorithms 1

Question 1

What is the average-case time complexity of QuickSort?

Accepted Answer

O(n log n)

Answer

O(n²)

Answer

O(n)

Answer

O(log n)

Question 2

Which sorting algorithm is considered stable and has a guaranteed worst-case time complexity of O(n log n)?

Accepted Answer

MergeSort

Answer

QuickSort

Answer

HeapSort

Answer

SelectionSort

Question 3

What is the time complexity of Binary Search on a sorted array of n elements?

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(n log n)

Answer

O(1)

Question 4

Which sorting algorithm has the best performance on nearly sorted data?

Accepted Answer

Insertion Sort

Answer

MergeSort

Answer

QuickSort

Answer

HeapSort

Question 5

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

Accepted Answer

O(n²)

Answer

O(n log n)

Answer

O(n)

Answer

O(log n)

Question 6

Which algorithm finds the k-th smallest element in an unsorted array in average O(n) time?

Accepted Answer

QuickSelect

Answer

Binary Search

Answer

MergeSort

Answer

HeapSort