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
Write a program to reverse a number?
Display names and numbers of employees who have 5 years or more experience and salary less than Rs.15000 using array of structures (name, number, experience and salary)
Write a pseudo code to evaluate a number to any base given (2...16) based on the input. Number greater than 9 should be given as A-F for 10-15.
1.what is the vesition managment.
In project we have Documentation phase also,in that what is micro and macro designing?
WHat is execution in manual testing and when will we start execution and what language we use in execution
What is the purpose of
How do i find out the number of parameters passed into function?
how to stop execution of step 3 in a job mainframe
how does database connection using ADO.NET?
Suppose server object is not loaded into the memory, and the client request for it , what will happen?
Any real time example of O2C process from taking order till creating invoice.
In OB52 , How to define two open posting period, Like only 5 and 8 posting should be open.. should not open 6 and 7..period..
hai i am prasanna.I am MCA 2009 fresher.tell me about certifications.which certification helps me to improve my carrier and to get a technically oriented job ,which certification helps to get job faster.
5. How do you round the addition or subtraction of two numbers in assembler?