merge sort time complexity
Answer Posted / banti sharma
Right its always (nlog n)in all cases whether its best case
or worst case.
| Is This Answer Correct ? | 69 Yes | 16 No |
Post New Answer View All Answers
how to get second highest salary from a employee table and how get a 5th highest salary from a employee table by using proc sql?
iam confused to choose among testing, .net and java can anybody help me????????
how to hide prompts
When will you use shell script/Perl ahead of C/C++?
what is the similarity between networking devices?
what is the software to run the GSM gate opener program
how can i split string in a textbox in windows appication using C#.net
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.
what are importance in problem tracking
in teradata level primary in table level allows duplicates why?
Suppose server object is not loaded into the memory, and the client request for it , what will happen?
why we use abstract in awt?
When we delete logfiles such as screenshots how does it affect the ldf file? Ive seen huge change while adding screenshots in the ldf file but a very minor one deleting them.Please Explain
SAS question: I have 50 fils a1,a2,...,a50. the primary key is upc. then if i want to merge all 50 files, the code is as follows, data test; merge a1 ... a50; by upc; run; we know that writing all 50 files name is time consuming, is there any standard format of this code?
For a binary tree with n nodes, How many nodes are there which has got both a parent and a child?