2 COMPUTER SCIENCE QUESTIONS

1. we want to sort (A,R,P,J,M,E,W) into ascending order.

A) How many comparisons are there if we use BUBBLESORT Algorithm?

B) Using the MergeSort Algorithm, How many times the function merge (11,12) will be invoked.

2. In your own detailed words, tell me the name of two search algorithms and two sorting algorithms. Why should we know what these are and the differences between them? Please provide an extensive answer and give general examples to make your case.