Expert: Zlatko - 11/11/2009

Question
n log 2n
Solve via merge sort & get the complexity..

Answer
Hello Lahiru

I will think about your problem. Have you tried to write a merge sort yourself? It would be good for you to try your assignments, then ask questions about what you don't understand. Do you need me to explain what a merge sort is? Are you having problems coding it? Are you having trouble calculating the complexity from your code? Let me know what the problem is.

Kind regards.
Zlatko


Lahiru, I've thought about your question and I've decided that the world does not need another explanation of merge sort. Have a look at
http://www.cprogramming.com/tutorial/computersciencetheory/mergesort.html
and
http://www.cprogramming.com/tutorial/computersciencetheory/merge.html
and
http://lmgtfy.com/?q=merge+sort

and if you have a more specific question, let me know.

Kind regards.
Zlatko