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
- 6946 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 |
Explain the register storage classes in c++.
How many types of casting are there in C++? When is a dynamic cast,static_cast,reinterpret cast used?
What are the advantages of c++ over c?
What is dev c++ used for?
What is static in c++?
How to defines the function in c++?
What are the effects after calling the delete this operator ?
What is malloc in c++?
Write a program which uses functions like strcmp(), strcpy()? etc
What is a down cast?
What parameter does the constructor to an ofstream object take?
how to explain our contribution in the project?
STL 
