Interested to Buy Any Domain ? << Click Here >> for more details...
merge sort time complexity
- 6 Answers
- 21501 Views
- BFL, CDAC, IBM, Jawaharlal Nehru Technological University JNTU, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / 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 |
Answer / ashfaque
Its correct in every cases , may be average, worst or best..
The time complexity is always O(n log n)
| Is This Answer Correct ? | 34 Yes | 8 No |
Answer / 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 |
kindly send interview materials
What is std::auto_ptr?
How to call static method in Java?
Given an array all of whose elements are positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array. So 3 2 7 10 should return 13 (sum of 3 and 10) or 3 2 5 10 7 should return 15 (sum of 3, 5 and 7)
What is procedural oriented language language..? give some examples of this language....?
Write 5 differences between Memory Reference Instruction and Register Reference Instruction.
WHAT IS MAIN IMPORTANT THING IN SOFTWARE?
the channel in the data communication model can be? option a.postal mail serv. b telephon lines c.radio signals d. all the above
2 Answers iNautix, National Investment Commission,
In mainframe SDSF, Can we copy the list of jobs currently executing in SDSF in to a seperate DATASET...?
0 Answers DST Global Solutions,
How to merge Action Form with Dyna Action Form in Struts.
what are all the validation we need to perform in data stage?
What are scrubbing procedures in SAS
C 
