Computer Science, asked by achyutananda69, 6 months ago

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 nsunita971
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