GkSeries.com

Q.

The complexity of merge sort algorithm is

[A] O(n)
[B] O(log n)
[C] O(n2)
[D] O(n log n)
Answer & Explanation
Option: [D]

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

Please share this page

Click Here to Read more questions

Teacher Eligibility Test