Which of the following is the worst-case time complexity of the merge-sort algorithm?

1
Θ(n lg n)
2
Θ(n1.5 lg n)
3
Θ(n2)
4
Θ(n)
5
Θ(lg n)

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation