Linear Search
Linear Search
// BINARY SEARCH
if (arr[mid] == target) {
return mid;
}
if (arr[mid] < target) {
left = mid + 1;
}
else {
right = mid - 1;
}
}
return -1;
}
if (!swapped) {
break;
}
}
}
bubbleSort(arr);
System.out.println("Sorted array:");
printArray(arr);
}
}