Why is merge sort faster?
- 1 Answers
- 991 Views
- I also Faced
- E-Mail Answers
Answer / Jogendra
Merge sort is generally considered faster than quicksort for large data sets because its average and worst-case time complexities are both O(n log n). Merge sort divides the array into smaller subarrays, sorts them independently using simpler algorithms like insertion sort, and then merges the sorted subarrays.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is a Breadth First Search? Give a few of its applications.
Explain different methods in which you can traverse a tree?
What are the tasks performed during inorder traversal?
What does each entry in the link list called?
How do we find duplicate elements in an array?
What is the default size of arraylist?
What is an externalizable interface?
What is a directed graph?
Explain data structure
What is meant by int?
Why is quicksort unstable?
What is meant by heap sort?
Windows 
