Which of the following is TRUE of the time complexity of the insertion sort algorithm to sort a list of ‘n’ integers?

1
Ω (n2)
2
Ω (n)
3
O(n)
4
O(n log (n))

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation