What is the worst case time complexity of insertion sort where position of the data to be inserted is calculated using binary search

O(n²)

Explanation:

The worse case time complexity of insertion sort using binary search for positioning of data would be O(n²).

This is due to the fact that there are quite a number of series of swapping operations that are needed to handle each insertion.

answer; i think/believe the correct answer is balance sheet;

answer; the above statement is (true);