Answer all the questions. 1. Write the pseudo code for the algorithm to calculate the product...

 

Transcribed Image Text:

Answer all the questions. 1. Write the pseudo code for the algorithm to calculate the product of two binary numbers using divide and conquer technique. Clearly show how to calculate the Big O of this algorithm. Use your algorithm to multiply 1101110 and 10101011, describing each step by drawing the recursion tree of the values of intermediary results. [10+ 10+20] 2. Write the pseudo code for the algorithm to sort numbers in a given array using divide and conquer technique. Clearly show how to calculate the Big O of this algorithm. Use your algorithm to sort (12,3,45,4,56,2,43,1), describing each step by drawing the recursion tree of the values of intermediary results. [20+20 + 30] Answer all the questions. 1. Write the pseudo code for the algorithm to calculate the product of two binary numbers using divide and conquer technique. Clearly show how to calculate the Big O of this algorithm. Use your algorithm to multiply 1101110 and 10101011, describing each step by drawing the recursion tree of the values of intermediary results. [10+ 10+20] 2. Write the pseudo code for the algorithm to sort numbers in a given array using divide and conquer technique. Clearly show how to calculate the Big O of this algorithm. Use your algorithm to sort (12,3,45,4,56,2,43,1), describing each step by drawing the recursion tree of the values of intermediary results. [20+20 + 30]