Computer Science, asked by achyutananda69, 8 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
complexity in this case as they
have same running time
O Cannot be decided​

Answers

Answered by tronytron5
0

Answer:

merge and ascend hhdjdnuxuse. usjebxudje d.dhdue duee

endhienr

Similar questions