What is the best sorting algorithm, when there is a large
amount of data, that cannot be fit in the main memory. ?
- 1 Answers
- 6190 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 the header file for setw?
Explain what are the sizes and ranges of the basic c++ data types?
What is ofstream c++?
Can you pass an array to a function in c++?
Implement a 2 dimensional array by one dimentional array
List out function which we can call without using object
Write a program which employs Recursion
What is == in programming?
why we cant create array of refrences
What is a singleton class c++?
List out some of the object-oriented methodologies?
How do we implement inheritance in c++?
STL 
