Question

The time complexity of insertion sort in worst case is?
Select one:
Ο Α.n(n-1)/4
OB. n(n+1)/2
O C. n(n-1)/2
0 D. n(n+1)/4​

Answer 1

Answer:

n(n-1)/2

Explanation:

please mark me as brainliest