Software engineering question:-

56. Consider the following C function named bin-search: unction searches in a presorted integer array arr int bin,search(int num) int min,max; nin -0; max-100; while(min!-nax) if (arr[(min max)/2]>num) nax-(min+max)/2; else if (arr[(ninmax)/2]