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
- 6807 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
what is the difference between overloading & overriding? give example.
What is purpose of new operator?
What is the benefit of learning c++?
Explain linear search.
What is a tree in c++?
What is difference between malloc()/free() and new/delete?
Is it possible to provide default values while overloading a binary operator?
What is object file? How can you access object file?
Why was c++ created?
What is type of 'this' pointer? Explain when it is get created?
Why is that unsafe to deal locate the memory using free( ) if it has been allocated using new?
What is the difference between while and do while loop? Explain with examples.
Is java based off c++?
What are the general quetions are in DEna bank manager IT/System interviews?
What do you mean by function and operator overloading in c++?
