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
- 6873 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 |
Explain about vectors in c ++?
pls help.. paper bills.. 1000, 500, 100, 50, 20, 10, 5, 1.. create a program that will count all the paper bills in the number being input.. example: enter a number: 3886 there is/are: 3 ->1000 1 ->500 3 ->100 1 ->50 1 ->20 1 ->10 1 ->5 1 ->1 example2: enter a number: 728 there is/are: 0 ->1000 1 ->500 2 ->100 0 ->50 1 ->20 0 ->10 1 ->5 3 ->1
what are the decision making statements in C++? Explain if statement with an example?
When we use Abstract Class and when we use Interface?where we will implement in real time?
How to implement flags?
Am pass the 10000 records to target in target I will take commit interval 15000 when I was stop the work flow what will happened
Why cstdlib is used in c++?
What is the difference between strcpy() and strncpy()?
What is #include c++?
How would you call C functions from C++ and vice versa?
Is c++ harder than java?
By using c++ with an example describe linked list?
STL 
