Given two pseudo codes of Quick Sort and Binary Search Sort Treealgorithms respectively. Use the array A[3,1,8,2,6,7,5] to runthough the two algorithms step by step(show the key intermediateresults) and analyze which algorithm is more efficient to sort thearray.Explain pros and cons of using the two algorithms.
Answer:
Expert Answer
An answer will be send to you shortly. . . . .