What is the best case running time for insertion sort?

Select one:
O(n)
O(log n)
O(n²)
O(n log n)
  • Interview Candidate
  • 3
  • 2455

Showing Answers 1 - 3 of 3 Answers

B.V. KUMAR

  • Feb 10th, 2015
 

O(n)

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions