Using the table and program codes given below, show step by step how many comparison are required until you find x = 54 and x = 77

binsrch(a[], n, x)

{

low = 1; high = n;

while (low

{

mid = (low + high) / 2

if (x

high = mid -1;

else if ( x > a[mid])

low = mid+1;

else

return mid;

}

return 0;

}

Computer Engineering Data structures Lesson

Index 1 N 3 4 5 6 7 8 9 10 11 12 Elements 4 7 8 9 16 20 24 38 39 45 54 77