What is the best sorting algorithm, when there is a large
amount of data, that cannot be fit in the main memory. ?
- 1 Answers
- 6203 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
Is set c++?
Define the process of error-handling in case of constructor failure?
What are the main features of c++?
Differentiate between structure and class in c++.
Why do we use double in c++?
What is ios in c++?
Is dev c++ free?
what are function pointers?
What is virtual table?
Arrange Doubly linked list in the ascending order of its integral value and replace integer 5 with 7?
Can we specify variable field width in a scanf() format string? If possible how?
Should the this pointer can be used in the constructor?
We all know that a const variable needs to be initialized at the time of declaration. Then how come the program given below runs properly even when we have not initialized p?
What is the arrow operator in c++?
What are the various access specifiers in c++?
