Interested to Buy Any Domain ? << Click Here >> for more details...
merge sort time complexity
- 6 Answers
- 21749 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 |
what is best way to create a Thread class & why?
Is class is a abstract datatype in java?
What is SAP TAO? · Which Version you are using? · What is the Latest Version in SAP TAO? · What are the Advantages in SAP TAO? · What are the Patches required for SAP TAO? · What is BPT? · Difference between BPT & SAP TAO? · Which Framework using for SAP TAO? · What is CBASE? · What is the SAP TAO Architecture? · What are the Prerequisites for SAP TAO? · SAP Solution Manager Mandatory for SAP TAO 1.0? · SAP Solution Manager Mandatory for SAP TAO 2.X? · What is UI Scanner? · What is Inspector? · How many ways to Create a components using TAO 1.0? · How many ways to Create a components using TAO 2.x? · Which service pack required for SAP TAO 2.7? · What is Import/Export? · What is Consolidate?
What is Big-O notation?
Which design patterns have you used?
Why data bus is bidirectional and address bus is unidirectional?
design a counter with the following repeated binary sequence: 0, 1, 2, 3, 4, 5, 6, 7, 8 using JK Flip Flop.
3 Answers College School Exams Tests, IBD, IBM, Ignou, IIIT, Nortech, TCS, UOS,
What is meant by spooling
Write a Pseudo Code to fins the LCM of two given numbers
What are two of your strengths that you will bring to our QA/testing team?
I am looking for NIC Sample papers or any patern of questions/ syllabus plz, send me on hamid.khan135@yahoo.in Regard
Write a program to implement BFS/ DFS routine in a connected graph
C 
