Why quicksort is faster than merge sort?


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

Post New Answer

More Data Structures Interview Questions

Which sorting method is slowest?

0 Answers  


Can we override compareto method for enumerations?

0 Answers  


Define threaded binary tree.

0 Answers  


an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].

0 Answers  


What is reduction to sorting method?

0 Answers  






State the advantages of using infix notations?

0 Answers  


What is concept of data structure?

0 Answers  


How do I start preparing for placement?

0 Answers  


In rdbms, explain what is the efficient data structure used in the internal storage representation?

0 Answers  


How expression trees are gets represented in data structure?

0 Answers  


Calculate the address of a random element present in a 2d array, given base address as ba.

0 Answers  


What is mean by merge sort?

0 Answers  


Categories