7) Define brute force approach and discuss its importance as an important algorithm design strategy

8) Illustrate Divide-and-Conquer approach and discuss it

9) Given the pseudocode below and answer questions: //Input: An array A[0..n 1] of orderable elements //Output: Array A[0..n 1] sorted in nondecreasing order for i 0 to n 2 do Mini for j i + 1 to n 1 do if A[j ]

10)

Given the pseudocode below and answer questions:

//Input: An array A[0..n 1] of n orderable elements

//Output: Array A[0..n 1] sorted in nondecreasing order

for i 1 to n 1 do

v A[i]

j i 1

while j 0 and A[j ]> v do

A[j + 1]A[j ]

j j 1

A[j + 1]v

1. Whats the basic operation and why?

2. Give its C(n)

3. Identify its time efficiency class

11. Describe MergeSort algorithm

12. Describe quicksort algorithm