I assume you mean binary search. Wikipedia has loads of information. You also haven t specified if you can use the stl.
The basic pseudo code is
min := 1;
max := N; {array size: var A : array [1..N] of integer}
repeat
mid := (min + max) div 2;
if x > A[mid] then
min := mid + 1
else
max := mid - 1;
until (A[mid] = x) or (min > max);
So in you case, min is 0, max is 100, where could alter the above algorithm to that it supports user input. All that needs to happen is rather than the comparison checks on an array, you just need to check user input.
min := 1;
max := 100;
repeat
mid := (min + max) div 2;
print mid;
c := getChar();
if c == h then
min := mid + 1
else if c == l
max := mid - 1;
else if c == y
return mid
until (min > max);
However if you want more help, you will need to post your code so far.