Java

Write a Java program called BinarySearch for the de-duplicated array (make sure it is sorted). The program prompts the user for an integer n to search, then print if the integer is found. If the integer is found, the program also prints how many checks it takes to find the integer. Otherwise, the program can just print Fail to find the input number... or something similar.

output array [11, 21, 33, 40, 50]