What is the best sorting algorithm, when there is a large
amount of data, that cannot be fit in the main memory. ?
- 1 Answers
- 6544 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 full form nasa?
How can virtual functions in c++ be implemented?
What is an arraylist c++?
Is c++ built on c?
What is pointer to member?
What is auto type c++?
What is the difference between a type-specific template friend class and a general template friend class?
Write about the local class and mention its use?
Can a constructor return a value?
Difference between pass by value and pass by reference?
What are the various access specifiers in c++?
what is data encapsulation in C++?
an operation between an integer and real always yeilds a) integer result b) real result c) float result
What is the prototype of printf function?
What is difference between rand () and srand ()?
