06、分析以下需求并完成代码 请编写代码实现二分查找在数组5533441122中查找33的索引独立完成!!

public class BinarySearch { public static void main(String[] args) { int[] arr = {11, 22, 33, 44, 55}; int target = 33; int left = 0; int right = arr.length - 1; int mid; while (left <= right) { mid = (left + right) / 2; if (arr[mid] == target) { System.out.println("33的索引为：" + mid); return; } else if (arr[mid] < target) { left = mid + 1; } else { right = mid - 1; } } System.out.println("未找到33"); }