What is the time and space complexities of merge sort and when is it preferred o

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

Question Posted / rajbahadur

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

More C Interview Questions

How can I access memory located at a certain address?

Write a program that takes a 5 digit number and calculates 2 power that number and prints it

Explain the bubble sort algorithm.

write a C program, given number is double without using addt ion and multiplication operator?ex:n=6,ans=12,pls send me ans to goviseenu@gmail.com

Hai friends im a i year student. i want to develop my knowledge in the field of TSR in c. How I'm Improve ?

difference between object file and executable file

What is array of structure in c programming?

Switch (i) i=1; case 1 i++; case 2 ++i; break; case 3 --i; Output of i after executing the program

nic scientist exam

Explain what is dynamic data structure?

difference between native and cross compilers

what is the difference between arrays and linked list

For more C Interview Questions Click Here