Interested to Buy Any Domain ? << Click Here >> for more details...
merge sort time complexity
- 6 Answers
- 21970 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 |
Can anyone send me NIC question papers alongwith answers on nidhi1485@yahoo.co.in? Urgently needed.. Thanks in advance
How to call static method in Java?
cgi stands for
3. . Explain the Cache memory? What is the advantage of a processor having more cache memory?
What is the GAC? What problem does it solve?
What is the purpose of <Trigger> element of <updatePanel> in Ajax
How to change the color of a cell or a row in a datagrid on mouse hover using javascript/.net
What function would you use to extract characters from a given string?
How to call dll API sub routine in VB Form.
how will you do destructive read and non destructive read in data queue.....
hii I inntrested abt scjp certification but i dont knw abt scjp plz send details abt scjp exam and syllabus.
there are N number of matchboxes numbered 1...N.each matchbox contain various number of stick.Two player can alternatevely pick some amount of stick from the higest stick containing box . The player is condidered win if there is no stick after his move.Find the final move so that the move player win. Note:In case the number of stick is equal ,pick the stick from the higest numbered box. eg: 3 box contain stick as:1,1,1. if u take 1 stick from 3rd numbred box you will any how win the match.
C 
