Simple linear search to find max min algo
maxmin(a,n,max,min)
{
max=min=a[1];
for i=2 to n do
{
if a[i]>max then
max:=a[i];
else if a[i]<min then
min:=a[i];
}
}
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
plz xplain