merge sort time complexity
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 |
How many forms can you create in a Visual Basic 6 Standard EXE project? Is there any limit on that?
what is lazy loading in hibernate?Explain in detailed manner?
Indentify the essential difference between GUI and a command line operating systems?
1 Answers Deloitte, Infosys, Wipro,
3. What is the difference between testing and Quality Assurance?
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.
Explain the difference between an expert and a novice user. How would your strategy for designing user interfaces for an expert user differ from that for designing user interfaces for a novice user.
What are the Short cut Keys of Tally ERP?
Explain with examples any 2 features of OOPS.
0 Answers Tavant Technologies, Verifone,
MOV.CB 007H,ADCON1 MOVE.CT 001H,_OPTION_REG_7 MOV.CB 007H,CMCON
how many trailing zeroes are there in 100! (100 factorial)?
whats the Need for Concurrency control
where is available in this mantis toturials?