engineering computer science MCQ #1238

What is the time complexity of Insertion Sort?

engineering computer science MCQ #1238

  1. Question 1

    Q1. What is the time complexity of Insertion Sort?

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

    Answer: O(n²)

    Explanation: Insertion Sort has a worst-case time complexity of O(n²) due to its iterative approach, making it less efficient for large datasets.