Time complexity1 closed

Question

Insertion sort using binary search instead of linear serach

1.Worst case Time O(n*n)

2.Best Case Time O(n)

3.Average case O(n*n)

am i correct?

Comments

btw how you implement insertion sort using Binary search ?? :3

---

implementation will be same only diff is that we will use binary search instead of linear search for finding the position of new element as except that element array is already sorted.https://www.geeksforgeeks.org/binary-insertion-sort/

---

there will be no affect of binary search because movements gonna compensate that profit we are getting so its same as linear