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
- 6806 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 |
What is the operator in c++?
Differentiate between an external iterator and an internal iterator?
what are difference between c and c++?
How can you create a virtual copy constructor?
Can non-public members of another instance of the class be retrieved by the method of the same class?
why can't we declare data member of class auto register or extern
How do you find out if a linked-list has an end? (I.e. The list is not a cycle)
In which situation the program terminates before reaching the breakpoint set by the user at the beginning of the mainq method?
What is setf in c++?
Is java as fast as c++?
What is late binding c++?
What is difference between initialization and assignment?
12 Answers HCL, HP, Infosys,
STL 
