What is the best sorting algorithm, when there is a large
amount of data, that cannot be fit in the main memory. ?
- 1 Answers
- 6184 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 std :: endl?
an operation between an integer and real always yeilds a) integer result b) real result c) float result
What is a volatile variable in c++?
What is the maximum combined length of command line arguments including the space between adjacent arguments?
Can we distribute function templates and class templates in object libraries?
What is an action class?
Explain the isa and hasa class relationships.
What is c++ manipulator?
How the virtual functions maintain the call up?
Is string data type in c++?
How delete [] is different from delete?
What are formatting flags in ios class?
STL 
