merge sort time complexity
- 6 Answers
- 20564 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 |
whats the use of following Good Coding Practices?
Please anyone tell me coding to print prime numbers from 1 to 5000 in c#....
how to display xisheet in list box in c# .net
Outline the two important features of a terminating recursion. Any ideas?
Difference between HTML and DHTML?
Describe the following: (i) DNS (ii) Name Resolution (iii) Subnet Masking (iv) Urgent Pointer
What is diffrent between Method and and function in c#
My Qualification is MCA.My interview is on 5th may.They may ask q as------AS u r MCA...Why u r not tring anywhere else? What can be the ans?
0 Answers State Bank Of India SBI,
what is posix?
How to get the index of the clicked field in reports in ABAP?
Please forward important interview and basic questions in VB6 on my email id: usneha_16@yahoo.co.in
Describe the difference between Interface-oriented, Object-oriented and Aspect-oriented programming
C 
