code: func (ss *SortedSlice) searchLessThan(e *Sortable, i, j int) int {
  	pivot := ((j + 1 - i) / 2) + i
  	if j-i == 1 {
  		if ss.s[i].Less(e) {
  			return i
  		}
  		return j
  	}
  	if ss.s[pivot].Less(e) {
  		return ss.searchLessThan(e, i, pivot)
  	}
  	return ss.searchLessThan(e, pivot, j)
  }
docs: // Recursive function to search for the next index less than Sortable