ICSE computer tuition near me: there is no centre down the road, and that helps.

import java.util.Scanner;

public class CitySearch {
    public static void main(String args[]) {
        String city[] = {"Agra", "Bhopal", "Chennai", "Dehradun", "Guwahati",
                         "Indore", "Kochi", "Lucknow", "Nagpur", "Patna",
                         "Ranchi", "Surat", "Vadodara"};
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter your city: ");
        String key = sc.next();
        int low = 0, high = city.length - 1, pos = -1, steps = 0;
        while (low <= high) {
            int mid = (low + high) / 2;
            steps++;
            int c = key.compareToIgnoreCase(city[mid]);
            if (c == 0) { pos = mid; break; }
            else if (c < 0) high = mid - 1;
            else low = mid + 1;
        }
        if (pos >= 0)
            System.out.println(city[pos] + " found at index " + pos
                               + " after " + steps + " comparisons");
        else
            System.out.println(key + " not in this list, checked in "
                               + steps + " comparisons");
    }
}

// Input lucknow:  Lucknow found at index 7 after 3 comparisons
// Input Shillong: Shillong not in this list, checked in 4 comparisons

The array must already be in alphabetical order. compareToIgnoreCase returns a negative number when the key comes earlier in the alphabet, so the search drops the right half.