Simple linear search to find max min algo
for i=2 to n do
if a[i]>max then
else if a[i]<min then
1.Average case complexity of the above algo given that the first if conditions fails for n/2 elements
2.Average case complexity of the above algo if the first condition fails 1/2 times
I think the translation looks like Tag=29...
What significance does this line holds in this...
First of all, congratulations!