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
- 6883 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 best c++ compiler?
What is class and structure in c++?
Explain the isa and hasa class relationships. How would you implement each?
What are references in c++?
Explain the difference between abstract class and interface in c++?
Where are setjmp and longjmp used in c++?
What is the basic structure of a c++ program?
Which operator cannot be overloaded c++?
Will a catch statement catch a derived exception if it is looking for the base class?
Explain the difference between class and struct in c++?
What is flush c++?
What are punctuators in c++?
Distinguish between a # include and #define.
How do you invoke a base member function from a derived class in which you’ve overridden that function?
To which numbering system can the binary number 1101100100111100 be easily converted to?
