QUESTIONS

Find the complexity of the algorithm as Big $O$ notation:

countValue$($a$,$ n$,$ val$)$

$1$

count $=0$

for $i=1$ to

if $)=(val$

count $=$ count $+1$

$\}$

return count

i

Write the algorithm which sorts the array by using the merge sort algorithm. Then find the complexity of the algorithm as Big $O$ notarion.

Write the algorithm which sorts the array by using the quick sort algorithm. Then find the complexity of the algorithm as Big $O$ notation.

Good luck...