What is the best sorting algorithm, when there is a large
amount of data, that cannot be fit in the main memory. ?
- 1 Answers
- 6194 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
How do we implement inheritance in c++?
Write a c program for binary addition of two 8 bit numbers.
Write a program to show polymorphism in C++?
Explain the static member function.
What is pointer to array in c++?
what Is DCS ? what i will get benefit when i did?
What will the line of code below print out and why?
Differences between private, protected and public and give examples.
Write a program that takes a 5 digit number and calculates 2 power that number and prints it.
Write a program which uses Command Line Arguments
How do you clear a map in c++?
Do the names of parameters have to agree in the prototype, definition, and call to the function?
Why pointer is used in c++?
Briefly describe a B+ tree. What is bulk loading in it?
What is & in c++ function?
