Create a new binaryFind method in the Searcher class that works on any object of the type Comparable and takes a List of Comparable objects.

Question

What will be an ideal response?

Answer 1

```
/? ?
? Method t o u s e a b i n a r y s e a r c h t o f i n d a t a r g e t c o m p a r a b l e
? o b j e c t in a l i s t of comparable o b j e c t s
? @param t a r g e t t h e o b j e c t you a r e l o o k i n g f o r
? @param l i s t t h e l i s t o f c o m p a r a b l e o b j e c t s t o l o o k i n
? @return a s t r i n g t e l l i n g you i f i t was found
?/
public s t a t i c S t r i n g b i n a r y F i n d ( Comparable t a r g e t ,
L i s t l i s t )
{
int s t a r t = 0 ;
i n t end = l i s t . s i z e ( ) ? 1 ;
int checkpoint = 0 ;
while ( s t a r t <= end )
{ // While t h e r e a r e more t o s e a r c h
// f i n d t h e m i d d l e
c h e c k p o i n t = ( s t a r t+end ) / 2 ;
System . out . p r i n t l n ( ” Checking a t : ”+
c h e c k p o i n t+” s t a r t=”+s t a r t+” end=”+end ) ;
i f ( t a r g e t . compareTo ( l i s t . g e t ( c h e c k p o i n t ) ) == 0 )
{
return ”Found i t ! ” ;
}
e l s e i f ( t a r g e t . compareTo ( l i s t . g e t ( c h e c k p o i n t ) ) > 0 )
{
s t a r t=c h e c k p o i n t + 1 ;
}
e l s e i f ( t a r g e t . compareTo ( l i s t . g e t ( c h e c k p o i n t ) ) < 0 )
{
end=c h e c k p o i n t ? 1 ;
}
}
return ”Not found ” ;
}
```