title: Generics not so generic !
body: <p>I tried to implement a generic binary search algorithm in scala. Here it is :</p>
  
  <pre><code>type Ord ={
  def &lt;(x:Any):Boolean
  def &gt;(x:Any):Boolean
  }
  def binSearch[T &lt;: Ord ](x:T,start:Int,end:Int,t:Array[T]):Boolean = {
  if (start &gt; end) return false
  val pos = (start + end ) / 2
  if(t(pos)==x)         true
  else if (t(pos) &lt; x)  binSearch(x,pos+1,end,t)
  else                binSearch(x,start,pos-1,t)
  }
  </code></pre>
  
  <p>everything is OK until I tried to actually use it (xD) :</p>
  
  <pre><code>binSearch(3,0,4,Array(1,2,5,6))
  </code></pre>
  
  <p>the compiler is pretending that Int is not a member of Ord, but as I know class Int has <code>&lt;</code>and <code>&gt;</code> methods. 
  Well what shall I do to solve this weird problem?
  Thanks </p>