merge sort time complexity

Answer Posted / a. raju

mergsort best case and worst case time colexcity is 0(n log n)
and worst time complex city 0(n+m).

Is This Answer Correct ?    9 Yes 21 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Plz sent me in .net 2.0 interview Question & answers?

1632


how do we provide security for web services

1796


What is BASIS

1659


hai i am mca 2009 fresher.please tell me which certification helps me to get an IT job faster which institute is good in hyderabad.please mail me to prasanna.1856@rediff.com

1524


I am looking for NIC Sample papers or any patern of questions/ syllabus plz, send me on hamid.khan135@yahoo.in Regard

1531






what is class module in vb6? what it's use? with example..

1943


what is the certificates in biztalk?

1423


what is the basic and unique feature of dotnet

1708


Explain polymorphism. Provide an example.

612


how to work search engine? plz detail answer me.

1483


write a query that returns one row for each department and the number of employees in that department. Given two tables EMPLOYEE and DEPARTMENT, where there can be multiple employees per department.

1172


Definition of Singleton Class? what is the Purpose of it? what is the advantage?

1586


how to data grid use in data bind?

1490


how to hide prompts

1455


what are the advantages of sap on other software ?

1722