Java code.array sorting please help

Implement Binary search using Divide and Conquer (Iterative and Recursive). Consider the following input and find out average case time complexity for successful search. Print the number of comparisons required for each key in the list and calculates average case time complexity. Input: Index 0 1 1 2 3 4 5 6 7 Elements -15 -6 0 7 9 23 54 82 8 9 10 11 12 13 101 112 125 131 142 151 Output : 2 6 7 9 Index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 Elements -15-6 0 7 9 23 54 82 101 112 125 131 142 151 Comparisons 3 4 2 4 3 4 1 4 3 4 2 4