Time complexity of sorting algorithms

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

• O(n)

• O(nlogn)

• O(n2)

• O(logn)

Which sorting algorithm has a worst-case time complexity of O(n2)?

• Merge Sort

• Quick Sort

• Heap Sort

• Bubble Sort

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

• O(nlogn)

• O(n2)

• O(n)

• O(logn)

Which sorting algorithm consistently has a time complexity of O(nlogn) in the worst case?

• Quick Sort

• Merge Sort

• Bubble Sort

• Insertion Sort

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

• O(n)

• O(nlogn)

• O(n2)

• O(logn)

Which sorting algorithm has an average-case time complexity of O(n2)?

• Bubble Sort

• Merge Sort

• Quick Sort

• Heap Sort

What is the average-case time complexity of Merge Sort?

• O(nlogn)

• O(n2)

• O(n)

• O(logn)

Which sorting algorithm is typically faster in practice for large datasets despite having the same average-case time complexity as Merge Sort?

• Insertion Sort

• Bubble Sort

Which sorting algorithm is the fastest for sorting small arrays?

• Insertion Sort

• Merge Sort

• Quick Sort

• Selection Sort

What is the space complexity of Heap Sort?