Start learning 50% faster. Sign in now
Merge sort is a highly efficient sorting algorithm for large datasets due to its divide-and-conquer approach. It divides the array into smaller subarrays, sorts them individually, and then merges them in a sorted manner. With a time complexity of O(nlog n) in all cases (best, average, and worst), merge sort is highly predictable and handles large datasets efficiently. It is stable and works well for linked lists and external sorting, where data cannot fit into main memory. Why Other Options Are Incorrect :
Sam and John can complete a piece of work in 8 days and 12 days respectively. They work together but after 2 days, Sam leaves. John finishes the remaini...
(y+15) men can do a piece of work in (z-30) days. (y-15) men can do the same piece of work in (z+45) days. If (y+25) men can do the same work in (z-45) ...
Atul, Qureshi, and Chintu can individually complete a certain task in 27 days, 30 days, and 36 days, respectively. They all begin working on the task to...
Mike and Jenny alone can complete a task in 24 days and 40 days respectively. They aim to finish the work in 'd' days. What percentage increase in Jenny...
The efficiency ratio of workers A and B is 15:17. If both A and B collaboratively finish a task in 30 days, how long would it take for A to complete the...
'P', 'Q', and 'R' can individually complete a task in 20, 24, and 30 days, respectively. They all started working together, but '...
Ankit began a task but left it after working for 32 days. The remaining 60% of the task was then completed by Bittu and Sittu wor...
5 Pandavas can do a work in 18 days, 4 Kauravas can do the same work in 30 days. Now, in how many total days the total work be finished if 1 Panadva and...
Aman can complete a task in 12 days, while Bhanu alone can complete the same task in 18 days. Aman starts the work alone and continues for 4 days. Then,...