What is the best sorting algorithm, when there is a large
amount of data, that cannot be fit in the main memory. ?
- 1 Answers
- 6502 Views
- Yahoo, I also Faced
- E-Mail Answers
Answer / 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 |
What is difference between class and function?
Explain the scope resolution operator?
What is c++ hiding?
What is a wchar_t in c++?
What are the conditions that have to be met for a condition to be an invariant of the class?
What are the advantages of using typedef in a program?
Explain what data encapsulation is in c++?
What are c++ data types?
How many storage classes are available in C++?
What is the difference between global int and static int declaration?
On throwing an exception by the animal constructor in p = new animalq, can memory leak occur?
How can I learn c++ easily?
STL 
