What is the best sorting algorithm, when there is a large
amount of data, that cannot be fit in the main memory. ?
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 |
Difference between Overloading and Overriding?
35 Answers Appnetix Techno, GameLoft, HP, IBM, NIIT, Rohde and Schwarz,
Write a C/C++ program to show the result of a stored procedure "PROC_RESET_MAIL" on database "USER_NOTIFY".
2 Answers ABC, Accenture, DataLand, HCL, Webyog,
List the advantages of inheritance.
Write a C/C++ program that connects to a MySQL server and checks if the InnoDB plug-in is installed on it. If so, your program should print the maximum number of concurrent threads that the InnoDB plug-in can create
What are the uses of c++ in the real world?
Describe the setting up of my member functions to avoid overriding by the derived class?
What is array give example?
Is std :: string immutable?
What is size of empty class object
Where are setjmp and longjmp used in c++?
Are c and c++ different?
Is atoi safe?