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
- 6947 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 c++ slower than c?
What is dev c++ used for?
How can you link a c program with a c function?
Explain stack & heap objects?
What is the difference between a template and a macro?
Can malloc be used in c++?
Is java as fast as c++?
Explain the difference between using macro and inline functions?
What is the difference between the indirection operator and the address of oper-ator?
What is the maximum value of a unsigned char a) 255 b) 256 c) 128
What is boyce codd normal form in c++?
What is a container class?
What is the purpose of the "delete" operator?
What is the copy-and-swap idiom?
What is recursion?
