Question: Given that all sorting algorithms strive to be efficient in terms of time and memory usage, which of the following is the biggest disadvantage of
Given that all sorting algorithms strive to be efficient in terms of time and memory usage, which of the following is the
biggest disadvantage of merge sort?
The algorithm uses recursion.
The algorithm uses a divideandconquer algorithm, which is inefficient.
It requires a temporary array.
In its worst case it is very inefficient.
The merge method is inefficient.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
