return middle;
else if (value > int_array[middle])
return binarySearch((middle + 1), last, value);
return middle;
else if (value > int_array[middle])
return binarySearch((middle + 1), last, value);
for (int i = 0; i < getCurrentSize(); i++) {
if (int_array[i] == value) {
// Deleting the element in the tab
for (int i = 0; i < getCurrentSize(); i++) {
if (int_array[i] == value) {
// Deleting the element in the tab