engineering computer science MCQ #1242

What is the time complexity of Quick Sort?

engineering computer science MCQ #1242

  1. Question 1

    Q1. What is the time complexity of Quick Sort?

    • A) O(n)
    • B) O(n log n)
    • C) O(n²)
    • D) O(2^n)

    Answer: O(n log n)

    Explanation: Quick Sort has an average-case time complexity of O(n log n) due to its divide-and-conquer approach, making it efficient for large datasets.