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
- 6899 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 a binary file? List the merits and demerits of the binary file usagein C++.
What is a stack? How it can be implemented?
Do the names of parameters have to agree in the prototype, definition, and call to the function?
What are activex and ole?
What is command line arguments in C++? What are its uses? Where we have to use this?
Are vectors passed by reference c++?
What is data hiding c++?
What character terminates all character array strings a) b) . c) END
Can you think of a situation where your program would crash without reaching the breakball, which you set at the beginning of main()?
When the constructor of a base class calls a virtual function, why doesn't the override function of the derived class gets called?
What is else syntax in c++?
Write a program which uses Command Line Arguments
STL 
