What is the time and space complexities of merge sort and when is it preferred over quick sort?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More C Interview Questions

I didn't count the ducks that I saw in line, but I do remember that one duck was in front of two ducks, another duck behind two ducks. How many ducks did I see?

2 Answers  


write a program to display & create a rational number

1 Answers   HCL, TCS,


Differentiate between null and void pointers.

0 Answers   TCS,


hi friends how r u as soon in satyam my interview is start but i m very confusued ta wat i do plz help me frndz wat can i do plz tell me some question and answers related with "C" which r asked in the interview .

0 Answers   Aegis, CDAC, Infosys,


‘ C’ PROGRAME TO SHOW THE TYPE OF TRANGLE BY ACCEPTING IT’S LENGTH .

0 Answers  






Why is malloc used?

1 Answers  


Explain spaghetti programming?

0 Answers  


how to find the largest element of array without using relational operater?

6 Answers   Satyam, Wipro,


what is the Output? int a=4 b=3; printf("%d%d%d%d%d%d",a++,++a,a++,a++,++a,a++); printf("%d%d%d%d%d%d",b--,b--,--b,b--,--b,--b);

10 Answers   IBM,


c pgm count no of lines , blanks, tabs in a para(File concept)

2 Answers  


What are enumerated types?

0 Answers  


What is static volatile in c?

0 Answers  


Categories