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
- 6902 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 |
When there is a global variable and local variable with the same name, how will you access the global variable?
Are php strings immutable?
How do you invoke a base member function from a derived class in which you’ve overridden that function?
what is software cycle? What is a mission critical system ? What is the important aspect of a real-time system ? Explain the difference between microkernel and macro kernel. Give an example of microkernel.Why paging is used ? Which is the best page replacement algo and Why ? What is software life cycle ? How much time is spent usually in each phases and why Which one do U want to work if selected in Honeywell ? Which are the different types of testing ? What is a distributed system ? Some questions about CSP. Which languages do U know ? What are the differences between Pascal and C. questions from Compiler construction and Lisp. Which are the different computer architecture? What is the requirement in MIMD ? What is the difference between RISC and CISC processors ? Difference between loosely coupled and tightly coupled systems ? What is an open system?
What happens when you make call 'delete this;'?
What is operator overloading in c++ example?
Is facebook written in c++?
What is pair in c++?
Please explain class & object in c++?
write a C++ programming using for loop: * * * * * * * * * *
What is difference c and c++?
What is #include math h in c++?
STL 
