Which sorting algorithm is best for large data?
- 1 Answers
- 962 Views
- I also Faced
- E-Mail Answers
Which sorting algorithm is best for large data?..
Answer / Dheerendra Singh Sirohi
For large datasets, Merge Sort or QuickSort algorithms are often considered the most efficient due to their average and worst-case time complexity of O(n log n).
| Is This Answer Correct ? | 0 Yes | 0 No |
More Data Structures Interview Questions
What is circular linked list?
What are data and data types?
What is the difference between Strings and Arrays?
What is an object array?
how to find the number of possible tree in the given tree.
12 Answers Persistent, TCS, Wipro,
What are the benefits of using arrays?
Why do we study data structures?
Why sorting is used?
Write a program to reverse a link list.
Describe queue operation.
Can we change load factor of hashmap?
Is selection sort greedy?
Windows 
