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

Practice Questions

Q1
What is the best-case time complexity of Insertion Sort?
  1. O(n log n)
  2. O(n^2)
  3. O(n)
  4. O(log n)

Questions & Step-by-Step Solutions

What is the best-case time complexity of Insertion Sort?
  • Step 1: Understand what Insertion Sort is. It is a sorting algorithm that builds a sorted array one element at a time.
  • Step 2: Know that the best-case scenario occurs when the array is already sorted.
  • Step 3: In this case, Insertion Sort only needs to check each element once to confirm it is in the correct position.
  • Step 4: Since there are 'n' elements in the array, the algorithm will make 'n' comparisons.
  • Step 5: Therefore, the time taken in the best-case scenario is proportional to 'n', which is expressed as O(n).
No concepts available.
Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely