Interested to Buy Any Domain ? << Click Here >> for more details...
What is the best sorting algorithm, when there is a large
amount of data, that cannot be fit in the main memory. ?
- 1 Answers
- 6820 Views
- Yahoo, I also Faced
- E-Mail Answers
Answer Posted / pritam
Merge sort is a best way to sort a large amount of data that cannot fit is memory. It is an external sorting algorithm i.e
sorting algorithm to be used when elements to be sorted do not fit in memory.
ANALYSIS :
best case,worse case and average case performance of
" O(n logn) "
and space complexity of O(n) (auxiliary)
| Is This Answer Correct ? | 2 Yes | 1 No |
Post New Answer View All Answers
What is a type library?
What is bubble sort c++?
How much is c++ certification?
What do you mean by storage classes?
What is the syntax for a for loop?
Do vectors start at 0 c++?
Is c++ harder than java?
Write a program to show polymorphism in C++?
Difference between overloaded functions and overridden functions
What is iterator in c++?
How can an improvement in the quality of software be done by try/catch/throw?
What is the best c++ ide?
Is there a sort function in c++?
What is the return value of the insertion operator?
Can we define function inside main in c++?
