int middle = (first + last) / 2;
if (value == int_array[middle])
return middle;
- if (value > int_array[middle])
+ else if (value > int_array[middle])
return binarySearch((middle + 1), last, value);
return binarySearch(first, (middle -1), value);
}
integer.afficher();
System.out.println("Current size " + integer.getCurrentSize());
-
}
}