Programming Assignment 3: Autocomplete


/* *****************************************************************************
 *  Describe how your firstIndexOf() method in BinarySearchDeluxe.java
 *  finds the first index of a key that is equal to the search key.
 **************************************************************************** */




/* *****************************************************************************
 *  Suppose you know that the terms in some sample file are evenly
 *  distributed, i.e. the number of terms starting with any given 
 *  letter are roughly the same (so the number of words starting with 'a'
 *  is very similar to the ones starting with 'b', and so on).
 *
 *  How would you modify your implementation of firstIndexOf()/lastIndexOf()
 *  to be more efficient *in practice* for this distribution of terms?
 *  More efficient in practice means that it would be faster for most
 *  keys, but in the worst case it could still require 2 + log_2 n compares.
 *
 *  Note that you don't have to write any Java code, your answer can be
 *  a description of how you'd modify your binary search solution.
 **************************************************************************** */




/* *****************************************************************************
 *  List any other comments here. Feel free to provide any feedback   
 *  on how much you learned from doing the assignment, and whether    
 *  you enjoyed doing it.                                             
 **************************************************************************** */
