求一个冒泡查找算法的Java实现

Question

原始数组：int[] arr = {8, 2, 3, 1, 4, 4, 9};

例如要查找的值是4，那么排好序后数组：arr = {4,4,1,2,3,8,9}

public void static void bubbleFindSort(int[] arr, int value){
//todo 算法实现部分
}

Answer 1

public static int[] bubbleFindSort3(int[] arr, int value) {
int times = 0;
int index = 0;
for (int i = 0; i < arr.length - 1; i++) {
for (int j = index; j < arr.length - 1 - i; j++) {
if (arr[j] == value) {
arr[index] = arr[j] + 0 * (arr[j] = arr[index]);
index++;
} else {
if (arr[j] > arr[j + 1]) {
arr[j] = arr[j + 1] + 0 * (arr[j + 1] = arr[j]);
}
}
times++;
}
}
System.out.println("计算了" + times + "次。");
return arr;
}