Divide and Conquer Strategy

**1.**Which of the following sorting algorithm is of divide-and-conquer type?

**2.**Which of the following versions of merge sort algorithm does uses space efficiently?

**3.**. The divide and conquer merge sort algorithm’s time complexity can be defined as

**4.**Merge sort invented by _____________

**5.**Application of mergesort _________

**6.**The sorting , which works very well for small file is ______________

**7.**Merge sort is _________.

**8.**Advantage of finding maximum and minimum using divide and conquer method instead of using conditional operators is __________________

**9.**

The time complexity of Strassen’s algorithm is ___________

**10.**By Strassen’s equation what is wrong in the following equation