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
- 6901 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
Explain the uses oof nested class?
Am studying basic c++ programming, have been given the following assignment. Design a linear program to calculate the maximum stress a material can withstand given a force and a diameter of a circle. To find the required area pi should be defined. Have most of the program sorted out but am at a loss as to how to show the calculations required. Can anyone help?
Is it possible for the objects to read and write themselves?
Give an example of run-time polymorphism/virtual functions.
What is the difference between while and do while loop?
What is the difference between a declaration and a definition?
Should the member functions which are made public in the base class be hidden?
What do the header files usually contains?
What does scope resolution operator do?
What are move semantics?
Do the parentheses after the type name make a difference with new?
What is virtual base class?
What is the difference between strcpy() and strncpy()?
What are c++ manipulators?
Is c++ a software?
