The input to a merge sort is
6,5,4,3,2,1 and the same input is
applied to quick sort then which
is the best algorithm in this case
*
O Merge sort
O Quick sort
Both have same time
O complexity in this case as they
have same running time
O Cannot be decided
Answers
Answered by
1
Answer:
O complexity in this case as they
have same running time.
It is your correct answer.
mark the answer brainlist.
and thanks me.
Similar questions
Science,
4 months ago
Math,
4 months ago
Science,
1 year ago
Environmental Sciences,
1 year ago
Science,
1 year ago