merge sort time complexity

Answers were Sorted based on User's Feedback



merge sort time complexity..

Answer / guest

O(n log n)

Is This Answer Correct ?    121 Yes 7 No

merge sort time complexity..

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

merge sort time complexity..

Answer / mohd zeeshan

o(n log n)

Is This Answer Correct ?    29 Yes 0 No

merge sort time complexity..

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

merge sort time complexity..

Answer / fati ahmadi

(n log n)

Is This Answer Correct ?    4 Yes 1 No

merge sort time complexity..

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

Post New Answer

More Programming Languages AllOther Interview Questions

What is the difference between an EXE and a DLL?

3 Answers   ABC, Hykin Solutions, Infoedge, Infosys, Polaris,


What is ur porject Architecture? If anyone ask what i have to specify here..

0 Answers  


Write a Pseudo Code to fins the LCM of two given numbers

5 Answers   Goldman Sachs,


is it possible to learn sap from book without any tutorial. if yes please mention the beginner,s book of sap and also make your valuable advice for self study of sap .

0 Answers  


Create a class TicTacToe that will enable you to write a complete program to play the game of Tic-Tac-Toe. The class contains as private data a 3- by-3 double array of integers. The constructor should initialize the empty board to all zeros. Allow two human players. Wherever the first player moves, place a 1 in the specified square; place a 2 wherever the second player moves. Each move must be to an empty square. After each move determine whether the game has been won and whether the game is a draw. If you feel ambitious, modify your program so that the computer makes the moves for one of the players automatically. Also, allow the player to specify whether he or she wants to go first or second. If you feel exceptionally ambitious, develop a program that will play three-dimensional Tic-Tac-Toe on a 4-by-4-by-4

2 Answers  






How to print No.of.rows affected after updation using ADO.Net

0 Answers   Tech Mahindra,


why Java is not purely object oriented?

9 Answers   Persistent,


how we define two jobs have same name??is it exist??

0 Answers   CTS,


Explain with examples any 2 features of OOPS.

0 Answers   Tavant Technologies, Verifone,


how to stop execution of step 3 in a job mainframe

0 Answers  


write the a cl program with the following specification A. Accept 2 parameters-date and date type B. if date type is J then convert date to *MDY format C. if date type is M convert date to *JUL format 4.send a program message with the value of converted date Please explain for each with coding?

0 Answers  


i need informatica certification dumps(S-powercenter 8 mapping designer)......plz fwd it to my mail id:gaya1989@yahoo.com

1 Answers  


Categories